DSA Crash Course [Part 81] - Summing Squares Approach

In this lesson, Alvin explores the strategy to solving the following interview problem:

Write a function, summing_squares, that takes a target number as an argument. The function should return the minimum number of perfect squares that sum to the target. A perfect square is a number of the form (i*i) where i >= 1.

For example: 1, 4, 9, 16 are perfect squares, but 8 is not a perfect sq