Solution: First Missing Positive
Explore how to efficiently find the first missing positive integer in an unsorted array by applying the cyclic sort pattern. Understand the approach that rearranges elements in place to achieve linear time and constant space complexity, and learn to implement this solution step-by-step.
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 -
...