First Missing Positive at Netskope

Problem Description

Given an unsorted integer array `nums`. Return the _smallest positive integer_ that is _not present_ in `nums`. You must implement an algorithm that runs in `O(n)` time and uses `O(1)` auxiliary space.

Topics

Also asked at 34 companies