Subarrays With Sum K

MediumPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Subarrays With Sum K. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

Problem

TeachMint may need to analyze contiguous activity windows in a learner's engagement sequence. Given an integer array nums and an integer k, return the number of contiguous subarrays whose elements sum exactly to k.

Values may be positive, zero, or negative, so solutions must not rely on a sliding-window assumption.

Formal Specification

Implement count_subarrays(nums, k).

Input: nums, a list of integers, and k, an integer target sum.
Output: An integer representing the number of contiguous, non-empty subarrays whose sum equals k.

Constraints

1 <= len(nums) <= 2 * 10^5
-10^4 <= nums[i] <= 10^4
-10^9 <= k <= 10^9
Subarrays must be contiguous and non-empty

Function Signature

def count_subarrays(nums, k):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output