class Solution(object):
def subarraySum(self, nums, k):
"""
:type nums: List[int]
:type k: int
:rtype: int
"""
sum_map = {}
sum_map[0] = 1
count = curr_sum = 0
for num in nums:
curr_sum += num
# Check if sum - k in hash
count += sum_map.get(curr_sum - k, 0)
# add curr_sum to hash
sum_map[curr_sum] = sum_map.get(curr_sum, 0) + 1
return count
Download Subarray Sum Equals K.pyLeetcode 560 Subarray Sum Equals K problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.
Feedback is the most important part of any website.
If you have any query, suggestion or feedback, Please feel free to contact us.