# Maximum Total Beauty Of The Gardens: Practice Notes

Maximum Total Beauty Of The Gardens shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Gardens become complete at target flowers; leftover extras raise the minimum of the incomplete ones. Sort, choose how many gardens to complete from the right, and pour the rest into the incomplete prefix to lift its minimum.

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

Filling incomplete gardens past target, or ignoring the trade-off between one more complete garden and a higher incomplete minimum.

## 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 help for online coding assessments.