LC 41. First Missing Integer (Hard)

Problem Statement Given an unsorted integer array A, return the smallest missing positive integer. You must implement an algorithm that runs in O(n) time and uses O(1) auxiliary space. Example 1 I