# Special Array With X Elements Greater Than Or Equal X: Walkthrough

Special Array With X Elements Greater Than Or Equal X shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sort descending (or binary-search X). X is special if exactly X elements are >= X. At most one such X exists.

## 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

Returning the count of elements >= some candidate without checking equality to that candidate.

## 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 try it free.