Return the least number of perfect squares (1, 4, 9, 16, …) that sum to n.
n
Input: one line, the integer n. Output: the minimum count.
12
3
4 + 4 + 4.
13
2
4 + 9.
Run your code against the sample tests, or Submit to run the full suite.