Subarray Sum Pulse

Target Range Hashing

If CurrentSum - K was seen as a previous Prefix Sum, then a subarray with sum K exists between that point and the current index.

The Assignment

Your function receives nums and k.

1. Track sum and a count.
2. Use an Object map where map[sum] = frequency. Initialize map[0] = 1.
3. For each num:
   • Add to sum.
   • If map[sum - k] exists, add that frequency to count.
   • Update map[sum].
4. Print the final count.