TomoLink
CompaniesZeptoData Structures & AlgorithmsSubarray Sum Equals K
DSA
MediumArray

Subarray Sum Equals K

arrayhash tableprefix sum

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.

Examples

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 * 10 ^4
-1000 <= nums[i] <= 1000
-10 ^7 <= k <= 10 ^7
🤔
Medium
Difficulty
Topic Info
ModuleDSA
CategoryArray
Sub-topicHash Table
Tags
arrayhash tableprefix sum
Navigation
Subarray Sum Equals K [Medium] | Zepto Dsa | TomoLink