# Minimize Maximum Of Array: Explained

Minimize Maximum Of Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

You may decrease nums[i] by 1 and increase nums[i-1] by 1 any number of times. Minimize the final maximum. Binary-search M: the prefix sum through i must stay <= M*(i+1), because leftover can only move left.

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

## Common mistake

Moving value to the right, which the operation forbids.

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