Search
⌘K
Leetcode 2996. Smallest Missing Integer Greater Than Sequential Prefix Sum
Find the longest prefix starting at nums[0] where each element increments by 1, compute its sum S, and return the smallest integer x >= S that does not appear anywhere in nums.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.