← Back to questions
HackWithInfy• Prep

Subarray Sum Equals K

Difficulty
Medium
Acceptance Rate
46.8%

Problem Statement

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

A subarray is a contiguous non-empty sequence of elements within an array.

 

Example 1:

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

Example 2:

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

 

Constraints:

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

Similar Questions

Two SumEasyContinuous Subarray SumMediumSubarray Product Less Than KMediumFind Pivot IndexEasySubarray Sums Divisible by KMediumMinimum Operations to Reduce X to ZeroMediumK Radius Subarray AveragesMediumMaximum Sum Score of ArrayMedium