Leetcode 1798. Maximum Number of Consecutive Values You Can Make

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.