Add solution #2342

Author: JoshCrozier

README.md

@@ -527,6 +527,7 @@
 2244|[Minimum Rounds to Complete All Tasks](./2244-minimum-rounds-to-complete-all-tasks.js)|Medium|
 2300|[Successful Pairs of Spells and Potions](./2300-successful-pairs-of-spells-and-potions.js)|Medium|
 2336|[Smallest Number in Infinite Set](./2336-smallest-number-in-infinite-set.js)|Medium|
+2342|[Max Sum of a Pair With Equal Sum of Digits](./2342-max-sum-of-a-pair-with-equal-sum-of-digits.js)|Medium|
 2349|[Design a Number Container System](./2349-design-a-number-container-system.js)|Medium|
 2352|[Equal Row and Column Pairs](./2352-equal-row-and-column-pairs.js)|Medium|
 2364|[Count Number of Bad Pairs](./2364-count-number-of-bad-pairs.js)|Medium|

solutions/2342-max-sum-of-a-pair-with-equal-sum-of-digits.js

@@ -0,0 +1,28 @@
+/**
+ * 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/
+ * Difficulty: Medium
+ *
+ * You are given a 0-indexed array nums consisting of positive integers. You can choose two
+ * indices i and j, such that i != j, and the sum of digits of the number nums[i] is equal
+ * to that of nums[j].
+ *
+ * Return the maximum value of nums[i] + nums[j] that you can obtain over all possible indices
+ * i and j that satisfy the conditions.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maximumSum = function(nums) {
+  const map = new Map();
+
+  return nums.reduce((result, n) => {
+    const key = n.toString().split('').reduce((sum, n) => +n + sum, 0);
+    result = !map.has(key) ? result : Math.max(result, n + map.get(key));
+    map.set(key, Math.max(map.get(key) ?? 0, n));
+
+    return result;
+  }, -1);
+};