#637Hard#33 in Bloomberg's list· asked at 19 companies
First Missing Positive
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: nums = [1,2,0] Output: 3
Example 2
Input: nums = [3,4,-1,1] Output: 2
Example 3
Input: nums = [7,8,9,11,12] Output: 1
Constraints
- •
1 <= nums.length <= 10^5 - •
-2^31 <= nums[i] <= 2^31 - 1