# Maximum Element After Decreasing And Rearranging: Walkthrough

Maximum Element After Decreasing And Rearranging shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

You may decrease any element (not increase) and rearrange freely so that arr[0] == 1 and |arr[i] - arr[i-1]| <= 1. Sort ascending, set the first value to 1, then arr[i] = min(arr[i], arr[i-1] + 1). The last value is the maximum achievable.

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

## Common mistake

Increasing values (not allowed) or not forcing the start to 1, which can leave a gap from 1.

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