# Partition Array For Maximum Sum: Walkthrough
Partition Array For Maximum Sum shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
dp[i] = max over L=1..k of dp[i-L] + max(arr[i-L:i])*L, because a part of length L becomes its max times L.
## 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 k).
## Common mistake
Using a global max times n even when n>k, or forgetting to recompute the part max as L grows.
## 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.