Available question text
Find all integers that occur exactly once in nums and whose immediate neighbors (x-1 and x+1) do not appear in the array; return these "lonely" numbers in any order.
Related questions
Continue with questions that share topics or the same question type.
- Majority Element
Coding · Array · Boyer–Moore Majority Vote Algorithm · Counting
- Rank Teams by Votes
Coding · Array · Counting · Hash Table
- Task Scheduler
Coding · Array · Counting · Greedy
- Top K Frequent Elements
Coding · Array · Bucket Sort · Counting
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2150. Find All Lonely Numbers in the Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Apple
Find All Lonely Numbers in the Array
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 56.6. This is not an interview probability.
View source