560. Subarray Sum Equals K(Detailed Walkthrough with an example)
#leetcode #coding #hashmaps
Summary:
1. Anytime if you wish to reduce complexity from n^2 to n, think about how to remove the inner for loop. From there if its a sum related problem try to check instead of adding something check if you can search sum-k and if that works use a hash map so the search can be order 1 time.