Leetcode Perfect Squares problem. DP solution is slow, trying to figure out bottlenecks

Question

Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.

https://leetcode.com/problems/perfect-squa