MCPcopy Create free account
hub / github.com/Tiwarishashwat/InterviewCodes / maximumSum

Method maximumSum

MaxSumOfAPairWithEqualSumOfDigits.java:10–28  ·  view source on GitHub ↗
(int[] nums)

Source from the content-addressed store, hash-verified

8 return sum;
9 }
10 public int maximumSum(int[] nums) {
11 // HashMap<Integer,Integer> map = new HashMap<>();
12 int map[] = new int[82];
13 int ans=-1;
14 for(int num : nums){
15 int digitSum = getDigitSum(num);
16 if(map[digitSum]>0){
17 // int prevNum = map.get(digitSum);
18 int prevNum = map[digitSum];
19 ans = Math.max(prevNum + num, ans);
20 map[digitSum] = Math.max(prevNum,num);
21 // map.put(digitSum, Math.max(prevNum,num));
22 }else{
23 map[digitSum] = num;
24 // map.put(digitSum,num);
25 }
26 }
27 return ans;
28 }
29}

Callers

nothing calls this directly

Calls 1

getDigitSumMethod · 0.95

Tested by

no test coverage detected