Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Perfect Squares
Bookmark
Recursion
DP
BFS
Math
Input
Example 1 (3)
Example 2 (2)
Small (4)
Perfect square (1)
Medium (2)
Custom
n
=
12
squares
1
4
9
squares
1
4
9
squares
1
4
9
12
11
10
9
8
7
6
5
4
3
2
1
0
0
1
0
2
1
0
3
2
1
0
4
3
2
1
0
0
5
4
3
2
1
0
0
1
0
0
6
numSquares(4 - 1) = numSquares(3)
squares
1
4
9
12
11
10
9
8
7
6
5
4
1
3
3
2
2
1
1
0
0
0
0
1
0
2
1
0
3
2
1
0
4
3
2
1
0
0
5
4
3
2
1
0
0
1
0
0
6
numSquares(0)
squares
1
4
9
12
11
10
9
8
7
6
3
5
2
4
1
3
3
2
2
1
1
0
0
0
0
1
1
0
0
2
2
1
1
0
0
3
2
1
0
4
3
2
1
0
0
5
4
3
2
1
0
0
1
0
0
6
numSquares(1)
squares
1
4
9
12
11
10
9
8
7
4
6
3
5
2
4
1
3
3
2
2
1
1
0
0
0
0
1
1
0
0
2
2
1
1
0
0
3
3
2
2
1
1
0
0
4
3
2
1
1
0
0
0
5
4
3
2
1
0
0
1
0
0
6
1 needs 1 square(s)
squares
1
4
9
12
11
10
9
8
2
7
4
6
3
5
2
4
1
3
3
2
2
1
1
0
0
0
0
1
1
0
0
2
2
1
1
0
0
3
3
2
2
1
1
0
0
4
1
3
3
2
2
1
1
0
0
0
0
5
4
3
2
1
0
0
1
0
0
6
try 1x1 = 1
squares
1
4
9
12
11
10
9
1
8
2
7
4
6
3
5
2
4
1
3
3
2
2
1
1
0
0
0
0
1
1
0
0
2
2
1
1
0
0
3
3
2
2
1
1
0
0
4
1
3
3
2
2
1
1
0
0
0
0
5
2
4
1
3
3
2
2
1
1
0
0
0
0
1
1
0
0
0
0
6
9 needs 1 square(s)
squares
1
4
9
12
11
10
9
1
8
2
7
4
6
3
5
2
4
1
3
3
2
2
1
1
0
0
0
0
1
1
0
0
2
2
1
1
0
0
3
3
2
2
1
1
0
0
4
1
3
3
2
2
1
1
0
0
0
0
5
2
4
1
3
3
2
2
1
1
0
0
0
0
1
1
0
0
0
0
6
1 + 3 = 4 square(s) via 1
squares
1
4
9
12
11
10
9
1
8
2
7
4
6
3
5
2
4
1
3
3
2
2
1
1
0
0
0
0
1
1
0
0
2
2
1
1
0
0
3
3
2
2
1
1
0
0
4
1
3
3
2
2
1
1
0
0
0
0
5
2
4
1
3
3
2
2
1
1
0
0
0
0
1
1
0
0
0
0
6
1 + 1 = 2 square(s) via 1
squares
1
4
9
12
11
10
2
9
1
8
2
7
4
6
3
5
2
4
1
3
3
2
2
1
1
0
0
0
0
1
1
0
0
2
2
1
1
0
0
3
3
2
2
1
1
0
0
4
1
3
3
2
2
1
1
0
0
0
0
5
2
4
1
3
3
2
2
1
1
0
0
0
0
1
1
0
0
0
0
6
3
12 needs 3 square(s)
algo
master
.
io
Step:
Fewest perfect squares that sum to 12?
0 / 321
Input
Example 1 (3)
Example 2 (2)
Small (4)
Perfect square (1)
Medium (2)
Custom
n
=
12
0 / 321
algo
master
.
io
Step:
Fewest perfect squares that sum to 12?
