First Missing Positive
Solution ApproachWas this helpful?
Hard•array•Expected: O(n) time, O(n) space
hash-map
Problem
Given an unsorted integer array, find the smallest missing positive integer.
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
Reference solution unlocks after your first submission
Loading...