Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2342. Max Sum of a Pair With Equal Sum of Digits
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source