Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2342. Max Sum of a Pair With Equal Sum of Digits
Given an array of positive integers, find the maximum sum of two distinct elements whose digit sums are equal; if no such pair exists return -1. This reduces to grouping numbers by their digit-sum and taking the two largest values in each group to compute the maximum pair sum.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.