Smallest Missing Positive Integer
Asked at Goldman Sachs · Coding Questions · Difficulty: Hard · Last asked Jun 9, 2025
Given an unsorted integer array, find the smallest positive integer that does not occur in it. The array may hold negatives, zeros, duplicates and values larger than its length.
Loading the problem…
More Goldman Sachs interview questions
- Merge K Sorted Lists (including K=3)
- Goldman Hirevue Behavioral Bank (6 Questions)
- Goldman Sachs HireVue Behavioral and Recursion
- Probability and Statistics Drill: Eight Numeric Problems
- Explain Recursion to a Non-CS Audience
- Implement a Deque From Scratch