# Maximum Sum With Exactly K Elements: Study Guide
Maximum Sum With Exactly K Elements shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Start from some nums[i] and k times add the current value to the score then increment it. The best start is the maximum m, and the score is k*m + k*(k-1)/2.
## 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).
## Common mistake
Starting from a smaller element, or summing only the original value k times.
## 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 interview copilot.