Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Subarray Sum Equals K
Bookmark
Brute Force
Prefix Sum + Hash Map
Input
Classic
With Negatives
All Zeroes
Custom
nums
=
[1, 1, 1]
,
k
=
2
k =
2
count =
0
0
1
2
1
1
1
k =
2
count =
0
0
1
2
1
1
1
k =
2
count =
0
0
1
2
1
1
1
k =
2
count =
0
0
1
2
1
1
1
start
end
sum
1
≠
k
2
k =
2
count =
1
0
1
2
1
1
1
start
end
sum
2
=
k
2
count++
k =
2
count =
1
0
1
2
1
1
1
start
end
sum
3
≠
k
2
k =
2
count =
1
0
1
2
1
1
1
start
end
sum
1
≠
k
2
k =
2
count =
2
0
1
2
1
1
1
start
end
sum
2
=
k
2
count++
k =
2
count =
2
0
1
2
1
1
1
start
end
sum
1
≠
k
2
k =
2
count =
2
0
1
2
1
1
1
count =
2
subarrays with sum 2
algo
master
.
io
Step:
Start: count subarrays whose sum equals k by trying every start and end
0 / 8
Input
Classic
With Negatives
All Zeroes
Custom
nums
=
[1, 1, 1]
,
k
=
2
0 / 8
algo
master
.
io
Step:
Start: count subarrays whose sum equals k by trying every start and end
