Find Smallest Missing Positive Integer in O(n) Time
Overview
This question evaluates a candidate's skill in array algorithms and in-place algorithm design, emphasizing understanding of time and space complexity and handling edge cases when identifying the smallest missing positive integer.
Apple
Aug 4, 2025, 10:55 AM
Data Scientist
Onsite
Coding & Algorithms
0
0
Scenario
LeetCode-style algorithm phone interview
Question
Implement a function that returns the smallest missing positive integer in an unsorted integer array in O(n) time and O(
- space, then explain the complexity trade-offs.
Hints
Use index placement/cyclic sort to achieve constant extra space.