# Next Greater Element II: Practice Notes

Next Greater Element II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

The array is circular, so iterate 2n indices modulo n with a monotonic decreasing stack; write answers only on the first pass (i < n).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (linked-list rewiring, two pointers, or a monotonic stack) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Forgetting the wrap-around and treating it as a linear next-greater.

## 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 https://www.linkjob.ai/.