LeetCode 2815 - Max Pair Sum in an Array ( Naive Approach ) | Problem Solving | LeetCode
Question On LeetCode
You are given a 0-indexed integer array nums. You have to find the maximum sum of a pair of numbers from nums such that the maximum digit in both numbers are equal.
Return the maximum sum or -1 if no such pair exists.
LeetCode: https://leetcode.com/problems/max-pai...