Solution: First Missing Positive
Explore how to find the smallest missing positive integer in an unsorted array using cyclic sort. This lesson shows you how to achieve optimal O(n) time and constant space complexity by placing numbers in their correct positions and identifying the missing element efficiently.
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...