Leetcode - Subarray Sum Equals K Solution
1 min read

Leetcode - Subarray Sum Equals K Solution

Given an array of integers nums and an integer k, return the total number of continuous subarrays whose sum equals to k.

Example 1:

Input: nums = [1,1,1], k = 2
Output: 2

Example 2:

Input: nums = [1,2,3], k = 3
Output: 2


  • 1 <= nums.length <= 2 * 104
  • -1000 <= nums[i] <= 1000
  • -107 <= k <= 107

Solution in Python3

class Solution:
    def subarraySum(self, nums: List[int], k: int) -> int:
        def cummulativeSum(nums):
            total = 0
            yield 0
            for i in nums:
                total += i
                yield total
        seen_counts = Counter()
        cummulative_sum = cummulativeSum(nums)
        subarray_with_sum_k = 0
        for i in cummulative_sum:
          pair = i - k
          subarray_with_sum_k += seen_counts[pair]
          seen_counts[i] += 1
        return subarray_with_sum_k

Enjoying these posts? Subscribe for more

Adblocker detected! Please consider reading this notice.

We've detected that you are using AdBlock Plus or some other adblocking software which is preventing the page from fully loading.

That's okay. But without advertising-income, we can't keep making this site awesome.

We don't have any banner, Flash, animation, obnoxious sound, or popup ad. We do not implement these annoying types of ads!

We need money to operate the site, and almost all of it comes from our online advertising.

Please add thepoorcoder.com to your ad blocking whitelist or disable your adblocking software.