# Largest Sum Of Averages: Explained
Largest Sum Of Averages shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
dp[i][k] is the best score for the first i elements split into k groups. Prefix sums give each group average in O(1).
## 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(k n^2).
## Common mistake
Assuming more groups can hurt; using all k groups is always at least as good.
## 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.