Medium
Quiz
#560 Subarray Sum Equals K
APPROACH
Given an integer array nums and a target integer k, count and return the total number of contiguous non-empty subarrays whose elements sum to exactly k.
Example 1:
Input: nums = [1,1,1], k = 2
Output: 2
Example 2:
Input: nums = [1,2,3], k = 3
Output: 2
1 of 4
1:00
What is the optimal approach for this problem?