# Maximum Sum Of 3 Non-Overlapping Subarrays: Interview 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
Let W[i] be the sum of the length-k window starting at i. Precompute best-left[i] and best-right[i] (the winning start on each side). Then try every middle start m and pick left + m + right that maximize W sums.
## 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
A 3-nested scan of starts (O(n^3)) or allowing the three windows to overlap when you forget to separate them by k.
## 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 interview assistant.