FastPrep
Problem · Array

Find Max Sum with Same First and Last Digit

● EasyMicrosoftFULLTIMEOA
See Microsoft hiring insights

Given an array with integers, find the maximum sum of any 2 numbers whose first and last digits match.

E.g - [ 2, 36, 45, 306, 415] -> 36 + 306 < 45 + 415

Ans - 460

Examples
01 · Example 1
nums = [2, 36, 45, 306, 415]
return = 460

The maximum sum of any 2 numbers whose first and last digits match is obtained by adding 45 and 415, which gives us 460.

More Microsoft problems
drafts saved locally
public int findMaxSumWithSameFirstAndLastDigit(int[] nums) {
  // write your code here
}
nums[2, 36, 45, 306, 415]
expected460
sign in to submit