Return the smallest positive integer not present in an unsorted list, in O(n) time and O(1) extra space (you may modify the list).
Unlock this and every premium problem across all tracks — plus hidden-test grading, advanced AI engineering modules and new content every week.
Start 7-day free trial