Medium
Subarrays Summing to K
Medium
93 submissions
25 coins
+100 XP
Array
Hash Table
Prefix Sum
Problem Description
Count the number of contiguous, non-empty subarrays of `nums` 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
```
**Example 3:**
```
Input: nums = [1, -1, 0], k = 0
Output: 3
```
Constraints
- `1 <= nums.length <= 2 * 10^4`
- `-1000 <= nums[i] <= 1000`
- `-10^7 <= k <= 10^7`
Need help?
Connect with expert programmers for real-time collaborative coding, video meetings, and whiteboard sessions via CodeConnect.
Video Call
Whiteboard
Live Coding
Screen Share