# Remove Duplicates From Sorted Array II: Interview Notes

Remove Duplicates From Sorted Array II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Allow each value at most twice: write nums[i] when it differs from nums[write-2]. The write pointer is the new length.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Using a hashmap of counts, which wastes the fact that the array is already sorted.

## 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 Linkjob AI interview assistant.