First Missing Positive

#41
Hard
Array & Hashing
O(n)
O(1)
Amazon
Google
Meta
View on LeetCode

Problem Description

Given an unsorted integer array nums, return the smallest missing positive integer.