Freaks City

Problem Statement Given a positive integer n, determine the smallest number of perfect squares that sum to n. A perfect square is an integer equal to the square of another integer — for example, 1, 4, 9, and 16 are perfect squares; 3 and 11 are not. Naive Recursiev Approach A top-down recursive solution defines minSquares(x) as the minimum coun ...