Leetcode Problem 279. Perfect Squares

279. Perfect Squares

Leetcode Solutions

Initialize a DP array dp of size n+1 with all elements set to n+1.
Set dp[0] to 0 as the base case.
Loop from 1 to n (inclusive) to fill the DP array: a. For each i from 1 to n, loop through all square numbers j*j where j*j <= i. b. Update dp[i] to be the minimum of dp[i] and dp[i - j*j] + 1.
Return dp[n] as the result.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen