Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Subarray Sums Divisible by K
Bookmark
Brute Force
Prefix Sum + Hash Map
Input
Classic
Simple
All Multiples
Custom
nums
=
[4, 5, 0, -2, -3, 1]
,
k
=
5
k =
5
count =
0
0
1
2
3
4
5
4
5
0
-2
-3
1
k =
5
count =
0
0
1
2
3
4
5
4
5
0
-2
-3
1
k =
5
count =
0
0
1
2
3
4
5
4
5
0
-2
-3
1
start
end
sum
9
mod
5
=
4
k =
5
count =
0
0
1
2
3
4
5
4
5
0
-2
-3
1
start
end
sum
7
mod
5
=
2
k =
5
count =
2
0
1
2
3
4
5
4
5
0
-2
-3
1
start
end
sum
5
mod
5
=
0
divisible, count++
k =
5
count =
3
0
1
2
3
4
5
4
5
0
-2
-3
1
start
end
sum
3
mod
5
=
3
k =
5
count =
5
0
1
2
3
4
5
4
5
0
-2
-3
1
start
end
sum
0
mod
5
=
0
divisible, count++
k =
5
count =
6
0
1
2
3
4
5
4
5
0
-2
-3
1
start
end
sum
(-5)
mod
5
=
0
divisible, count++
k =
5
count =
7
0
1
2
3
4
5
4
5
0
-2
-3
1
start
end
sum
(-5)
mod
5
=
0
divisible, count++
k =
5
count =
7
0
1
2
3
4
5
4
5
0
-2
-3
1
start
end
sum
(-3)
mod
5
=
2
k =
5
count =
7
0
1
2
3
4
5
4
5
0
-2
-3
1
count =
7
subarrays divisible by 5
algo
master
.
io
Step:
Start: count subarrays whose sum is divisible by k by trying every start and end
0 / 23
Input
Classic
Simple
All Multiples
Custom
nums
=
[4, 5, 0, -2, -3, 1]
,
k
=
5
0 / 23
algo
master
.
io
Step:
Start: count subarrays whose sum is divisible by k by trying every start and end
