# Subarray Sum Equals K Prefix Hash (Practice 5026): Pattern Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note. ## Approach Count prefix sums seen so far; each earlier prefix equal to cur-k closes one valid subarray. ```python def subarray_sum(a,k): seen={0:1};cur=res=0 for x in a: cur+=x;res+=seen.get(cur-k,0);seen[cur]=seen.get(cur,0)+1 return res ``` ## Complexity Linear in the dominant input size for the scan; heap/tree variants add a log factor. ## Interview pitfalls State the invariant out loud, name the complexity, then code. Skipping the invariant is the usual fail mode. ## Practicing out loud Narrate the approach, complexity and one edge case in under a minute. Disclosure: I work on Linkjob AI, a real-time interview assistant. If you want live practice help, see [linkjob.ai](https://www.linkjob.ai/).