# Find Two Non Overlapping Sub Arrays Each With Target Sum: Interview Notes
Find Two Non Overlapping Sub Arrays Each With Target Sum shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Find two non-overlapping subarrays that each sum to target and minimize the sum of their lengths. Sliding-window (positives) or prefix-map for the shortest subarray ending at each index, plus a prefix-min of those lengths so a second window can pair with the best one to its left.
## 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
Allowing the two windows to overlap, or using the shortest subarray anywhere rather than a non-overlapping partner.
## 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 this tool.