Conclusion for Subarray Problems:

1. use prefix sum pointers/variables. Preserve the most useful/relevant prefix sum up to date
2. use prefix sum array. Either single value for one pass, or prefix sum arrays
3. if required time complexity is O(n) for finding array value correspondences, use hashmap
4. Use queue if requiring subarray sum == or close to some value k