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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1798. Maximum Number of Consecutive Values You Can Make

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact