What did you learn? Prefix sum + hash map is a powerful combination for subarray problems with exact sum constraints.
Initialize the hash map with to handle subarrays starting at index .
This pattern works because you're doing "complement lookup" on prefix sums, just like two-sum on values. This technique solves many variations: subarrays divisible by , subarrays with equal s and s, and more.