Solution: First Missing Positive
Solution: First Missing Positive asks for the smallest positive integer missing from an unsorted array, starting at one despite negative values. Use linear time and constant extra space.
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...