Count Subarrays with a Target Sum

Now the twist: count how many subarrays add up to a target k. Checking every pair is slow, but prefix sums plus a hash map crack it. 🎯

A subarray sum equals prefix[r + 1] minus prefix[l]. So a sum of k means two prefix values differ by exactly k.