Solution: First Missing Positive
Let's solve the First Missing Positive problem using the Cyclic sort pattern.
Statement
Given an unsorted integer array, nums
, return the smallest missing positive integer.
Create an algorithm that runs with an time complexity and utilizes a constant amount of space.
Note: The smallest missing positive isn’t the first positive number that’s missing in the range of elements in the input, but the first positive number that’s missing if we start from .
Constraints:
-
nums.length
-
nums[i]
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.