Available question text
Given paired arrays x and y, pick three indices with pairwise distinct x-values to maximize the sum of their y-values. This reduces to grouping y-values by x, taking the maximum y for each distinct x, and summing the top three such maxima (or returning -1 if fewer than three distinct x-values exist).
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 3572. Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source