Subarray Sum Equals K
MediumP1Coding
Given an integer array nums and an integer k, return the number of contiguous, non-empty subarrays whose sum equals k. The array may contain negative numbers and zeros.
Example 1
- Input
- nums = [1,1,1], k = 2
- Output
- 2
- Why
- [1,1] at indices 0-1 and 1-2.
Example 2
- Input
- nums = [1,2,3], k = 3
- Output
- 2
- Why
- [1,2] and [3].
Example 3
- Input
- nums = [1,-1,0], k = 0
- Output
- 3
- Why
- [1,-1], [0] and [1,-1,0].
Constraints
- 1 <= nums.length <= 2 * 10^4
- -1000 <= nums[i] <= 1000
- -10^7 <= k <= 10^7
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 8. ⌘Enter runs, ⌘⇧Enter submits.