Problem - Subarray Sum Equals K

Given an integer array $nums$ and an integer $k$, return the total number of subarrays whose sum equals $k$. You're solving the textbook prefix sum + hash map problem.

The combination gives $O(n)$ time. Note: the array can contain negative numbers, so the simple sliding window approach doesn't work.