Sum of perfect squares

#1

I used bottom up approach to solve this problem. I am getting TLE for the last test case.

#2

Hey @nidhigupta847
Please share your code

#3
#4

Hey @nidhigupta847
Replace min function by this
if(dp[i]>(1+dp[i-(j*j)]))
dp[i]=1+dp[i-(j*j)];
And it will run ,constraints must be really tight on this one
removing min function reduces function overheads(time to call ,pass etc)

#5

Still showing TLE for the last test case

#6

Share your code again.

#7
#8

Try submitting the same two three times.