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.

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 2996. Smallest Missing Integer Greater Than Sequential Prefix Sum

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact