Available question text
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.
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 2996. Smallest Missing Integer Greater Than Sequential Prefix Sum
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source