Available question text
Given an array of coin values, find the largest count of consecutive integers starting from 0 that can be formed as subset sums. This is a greedy/sorting problem: by sorting coins and maintaining the current reachable range [0..reach], each coin ≤ reach+1 extends that range; otherwise the streak stops.
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 1798. Maximum Number of Consecutive Values You Can Make
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source