Leetcode 279. Perfect Squares

Given n (1 ≤ n ≤ 10^4), find the minimum number of perfect square numbers that sum to n. This is essentially a coin-change/shortest-path problem over square-valued coins, solvable by dynamic programming or BFS and informed by number-theoretic results like Lagrange's four-square theorem.