# Next Greater Element I: Walkthrough

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

## Key idea

Monotonic decreasing stack over nums2, then map each value to its next greater.

## 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 answer, sliding window, stack, or in-place rewrite) 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

Scanning nums2 from the left without a stack (quadratic).

## 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 the Linkjob AI app.