Feb 12

Author: siddydutta

2025-02-February-LeetCoding-Challenge/Max Sum of a Pair With Equal Sum of Digits.py

@@ -0,0 +1,25 @@
+from collections import defaultdict
+
+
+class Solution:
+    def maximumSum(self, nums: list[int]) -> int:
+        max_sum = -1
+        ds_map = defaultdict(int)
+        for num in nums:
+            s = sum(map(int, str(num)))
+            if s in ds_map:
+                max_sum = max(max_sum, ds_map[s] + num)
+            ds_map[s] = max(ds_map[s], num)
+        return max_sum
+
+
+def main():
+    nums = [18, 43, 36, 13, 7]
+    assert Solution().maximumSum(nums) == 54
+
+    nums = [10, 12, 19, 14]
+    assert Solution().maximumSum(nums) == -1
+
+
+if __name__ == '__main__':
+    main()

2025-02-February-LeetCoding-Challenge/README.md

@@ -15,7 +15,7 @@
 | February 09 | [2364. Count Number of Bad Pairs](https://leetcode.com/problems/count-number-of-bad-pairs/) | Medium | Solved |
 | February 10 | [3174. Clear Digits](https://leetcode.com/problems/clear-digits/) | Easy | Solved |
 | February 11 | [1910. Remove All Occurrences of a Substring](https://leetcode.com/problems/remove-all-occurrences-of-a-substring/) | Medium | Solved |
-| February 12 | []() |  |  |
+| February 12 | [2342. Max Sum of a Pair With Equal Sum of Digits](https://leetcode.com/problems/max-sum-of-a-pair-with-equal-sum-of-digits/) | Medium | Solved |
 | February 13 | []() |  |  |
 | February 14 | []() |  |  |
 | February 15 | []() |  |  |
@@ -38,5 +38,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 6 | 6 | 0 |
-| Medium | 5 | 5 | 0 |
+| Medium | 6 | 6 | 0 |
 | Hard   | 0 | 0 | 0 |