# Maximum Width Ramp: Interview Notes

Maximum Width Ramp shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A ramp is i < j with nums[i] <= nums[j]; we want max(j-i). Build a decreasing stack of candidate i's, then scan j from the right and pop every i that still satisfies nums[i] <= nums[j], tracking j-i.

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

## Common mistake

Testing every pair or using a two-pointer that assumes the array is sorted, which it is not.

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