Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Count Number of Nice Subarrays
Bookmark
Brute Force
Prefix Sum + Hash Map
Sliding Window
Input
Example 1
All Even
Example 2
Custom
nums
=
[1, 1, 2, 1, 1]
,
k
=
3
0
1
2
3
4
1
1
2
1
1
count =
0
need exactly k =
3
0
1
2
3
4
1
1
2
1
1
count =
0
need exactly k =
3
0
1
2
3
4
1
1
2
1
1
left
right
include nums[
1
] =
1
count =
0
need exactly k =
3
0
1
2
3
4
1
1
2
1
1
left
right
include nums[
3
] =
1
count =
0
need exactly k =
3
0
1
2
3
4
1
1
2
1
1
left
right
include nums[
4
] =
1
count =
1
need exactly k =
3
0
1
2
3
4
1
1
2
1
1
left
right
include nums[
2
] =
2
count =
1
need exactly k =
3
0
1
2
3
4
1
1
2
1
1
left
right
include nums[
4
] =
1
count =
1
need exactly k =
3
0
1
2
3
4
1
1
2
1
1
left
right
2
is even, odds =
0
of k = 3
count =
2
need exactly k =
3
0
1
2
3
4
1
1
2
1
1
left
right
include nums[
4
] =
1
count =
2
need exactly k =
3
0
1
2
3
4
1
1
2
1
1
left
right
include nums[
4
] =
1
count =
2
need exactly k =
3
0
1
2
3
4
1
1
2
1
1
count =
2
nice subarrays
algo
master
.
io
Step:
Start of algorithm
0 / 34
Input
Example 1
All Even
Example 2
Custom
nums
=
[1, 1, 2, 1, 1]
,
k
=
3
0 / 34
algo
master
.
io
Step:
Start of algorithm
