time.
🧺 Space complexity: O(n)
Method 4 - One Pass and store the pair

We dont need to run the loop twice to calculate the maximum. We can calculate the maximum in first iteration itself.
Code

[{"language":"Java","code":"class Solution {\n    public int maximumSum(int[] nums) {\n        Map<Integer, List<Integer>> groups = new HashMap<>();\n        int max = -1;\n        for (int num : nums) {\n            int digitSum = sumDigits(num);\n            groups.computeIfAbsent(digitSum, l -> new ArrayList<>()).add(num);\n            List<Integer> list = groups.get(digitSum);\n            Collections.sort(list);\n            if (list.size() > 2) {\n                list.remove(0);\n            }\n            if (list.size() == 2) {\n                max = Math.max(max, list.get(0) + list.get(1));\n            }\n            \n        }\n        return max;\n    }\n    private int sumDigits(int num) {\n        int ans = 0;\n        while (num > 0) {\n            ans += num % 10;\n            num /= 10;\n        }\n\n        return ans;\n    }    \n}","lang":"java","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">class</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> Solution</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> {</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">    public</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> int</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> maximumSum</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">(</span><span style=\"color:#D73A49;--shiki-dark:#F97583\">int</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">[] </span><span style=\"color:#E36209;--shiki-dark:#FFAB70\">nums</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">) {</span></span>\n<span class=\"line\"><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">        Map&#x3C;</span><span style=\"color:#D73A49;--shiki-dark:#F97583\">Integer</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">, List&#x3C;</span><span style=\"color:#D73A49;--shiki-dark:#F97583\">Integer</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">>> groups </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">=</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> new</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> HashMap&#x3C;>();</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">        int</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> max </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">=</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> -</span><span style=\"color:#005CC5;--shiki-dark:#79B8FF\">1</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">;</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">        for</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> (</span><span style=\"color:#D73A49;--shiki-dark:#F97583\">int</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> num </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">:</span><span style=\"color:#24292E;--shik
Related Tags
