# Make Array Strictly Increasing: Interview Notes
Make Array Strictly Increasing shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
You may replace arr1[i] with any value from arr2 any times; minimize the number of replacements to make arr1 strictly increasing, or return -1. Sort/unique arr2; DP on (index, previous value) using binary search for the next larger replacement. Keep only the best operations for each previous-value choice.
## 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 * m log m).
## Common mistake
Greedily replacing every descent without considering that keeping the original value may be better later, or allowing equals.
## 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 interview assistant.