# Maximum Difference Between Increasing Elements: Study Guide
Maximum Difference Between Increasing Elements shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Find max nums[j] - nums[i] with j > i and nums[j] > nums[i], or -1 if no increasing pair exists. Track the minimum to the left; at each j update the answer with nums[j] - mini when nums[j] > mini, then mini = min(mini, nums[j]).
## 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
Returning the difference between global max and min without checking order (max may appear first) or returning 0 instead of -1 when the array is non-increasing.
## 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 AI interview copilot.