# Reduce Array Size To The Half: Practice Notes

Reduce Array Size To The Half shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Remove the fewest values (every occurrence of a chosen value goes away) so at least n/2 elements are gone. Count frequencies, sort them descending, and greedily pick the most frequent until the removed count >= n/2.

## 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 log n).

## Common mistake

Removing individual occurrences instead of whole values, or picking rare values first.

## 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 real-time interview help.