0279-perfect-squares.c

int min(int a, int b) {
    return a < b ? a : b;
}

int numSquares(int n) {
    int dp[n + 1];
    for (int i = 0; i <= n; i++) {
        dp[i] = INT_MAX; // Initialize to a large value
    }

    dp[0] = 0;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j * j <= i; j++) {
            dp[i] = min(dp[i], dp[i - j * j] + 1);
        }
    }

    return dp[n];
}