Available question text
Given an array nums of length n where each value is in [1,n], return all integers in [1,n] that are missing from nums. The core challenge is to identify absent values in O(n) time and O(1) extra space by leveraging the array itself (e.g., treating values as indices or marking visited positions).
Related questions
Continue with questions that share topics or the same question type.
- Find All Lonely Numbers in the Array
Coding · Array · Counting · Hash Table
- Find All Duplicates in an Array
Coding
- Find All K-Distant Indices in an Array
Coding
- Find Score of an Array After Marking All Elements
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Amazon
Leetcode 448. Find All Numbers Disappeared in an Array
Reported Apr 3, 2025 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source