Package g2301_2400.s2342_max_sum_of_a_pair_with_equal_sum_of_digits

Class Solution

java.lang.Object

g2301_2400.s2342_max_sum_of_a_pair_with_equal_sum_of_digits.Solution

public class Solution
extends Object

2342 - Max Sum of a Pair With Equal Sum of Digits\. 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._ **Example 1:** **Input:** nums = [18,43,36,13,7] **Output:** 54 **Explanation:** The pairs (i, j) that satisfy the conditions are: - (0, 2), both numbers have a sum of digits equal to 9, and their sum is 18 + 36 = 54. - (1, 4), both numbers have a sum of digits equal to 7, and their sum is 43 + 7 = 50. So the maximum sum that we can obtain is 54. **Example 2:** **Input:** nums = [10,12,19,14] **Output:** -1 **Explanation:** There are no two numbers that satisfy the conditions, so we return -1. **Constraints:** * 1 <= nums.length <= 105 * 1 <= nums[i] <= 109

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	maximumSum(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

maximumSum

public int maximumSum(int[] nums)