# Maximum Sum Of 3 Non-Overlapping Subarrays: Practice Notes
Maximum Sum Of 3 Non-Overlapping Subarrays shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Precompute window sums of length k, then best-left and best-right arrays; try every middle start and add the best left and right around it.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (string DP, sliding window, trie, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Greedily picking the current maximum window three times, which can overlap or miss a better triple.
## 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 https://www.linkjob.ai/.