Problem Set
#2
Perfect Squares
MediumAcceptance: 54.2%•MathDynamic ProgrammingBreadth-First Search•GoogleAmazonMicrosoftTCS DigitalInfosys DSEAdobeMetaBloomberg
Problem Statement
Given an integer n, return the least number of perfect square numbers that sum to n.
A perfect square is an integer that is the square of an integer; in other words, it is the product of some integer with itself. For example, 1, 4, 9, and 16 are perfect squares while 3 and 11 are not.
Examples
Example 1
Input:
n = 12Output:
3Explanation:
12 = 4 + 4 + 4. Three 4s (2² + 2² + 2²).
Example 2
Input:
n = 13Output:
2Explanation:
13 = 4 + 9. Two squares (2² + 3²).
Example 3
Input:
n = 1Output:
1Explanation:
1 = 1² (already a perfect square).
Constraints
1 <= n <= 10^4
Hints
1
2
3
4
5
6
7
8
9
10
Input n (positive integer):