First Missing Positive · Coding Interview Practice

First Missing PositiveGiven an unsorted integer array, return the smallest positive integer that does not appear in it. Run in O(n) time using O(1) extra space.Constraints

1 <= nums.length <= 10^5

-2^31 <= nums[i] <= 2^31 - 1

O(n) time and O(1) extra space

Examples

Input: nums = [1, 2, 0] Output: 3

Input: nums = [3, 4, -1, 1] Output: 2

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…