# Find All Lonely Numbers In The Array: Study Guide

Find All Lonely Numbers In The Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A number is lonely if it appears once and neither x-1 nor x+1 appears. Count frequencies, then keep values whose count is 1 and whose neighbors are absent from the map.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Only checking uniqueness and forgetting the adjacent-value condition, or treating x-1/x+1 as indices instead of values.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at official website.