279. Perfect Squares | 5 Ways | DP | Math | BFS | Lagrange & Legendre Theorem | Top-Down | Bottom Up

[@thefinestmeme3317]

oh my god you are absolutely amazing

[@RishiRajMusa]

I remembered my 12th math class, you are amazing.

[@nooob_coder]

most complete channel...come up with dsa series

[@hajikhalil4268]

I'm impressed with the way you explain the problem :)

[@pratik5756]

one of the most underrated DSA channel. keep up the good work bro!!!!

[@cybermonkey2807]

I have a feeling...you are gonna blow up on youtube very soon god bless.

[@gamenotover1600]

yo ,your pfp is same as my phone's wallpaper...Big fan of cowboy bebop

[@arastusharma439]

Awesome Explanation bro !! The math behind the theorem you explained it very well !! 👋👌✌

[@ritikrajprasad2407]

Just some doubt, if we are continuously dividing n by 4 and then the resultant is getting stored in n then the for loop is being run through that "modified" value of n, which would have a different square-root value than the actual n, then why even after this modification, we are getting the correct answer!!

[@satwiktatikonda764]

the only one channel wch discuss abt all the approaches

[@bharatmehta30]

Great explaination bhai. Thank you for doing beautiful work.

[@pawanmalik2998]

we can also solve this problem using coin change approch .... just find max possible number which square is less or equal to n then use coins i as (i*i) range from 1 to max possible number which square is less or equal to n

[@rajrajesh1669]

Yes but that will not be the most efficient approach though, If we're on the same page, It will be a 2-d Dp solution right? But it will not throw TLE either...

[@debabratagon7289]

Nice explanation bro

[@me-16ayushverma40]

these two theorem are life saver😅

[@meetpalsingh2933]

Was fast-paced, but nice explanation. Confused the hell out of me when you highlighted the node of 3rd depth instead of 4th.

[@kannank4269]

for checking whether it is i^2 + j^2 + k^ 2 = N, we can i and j uptill cube root of N, we can find k using i, j, N. this also works right?

[@debabratagon7289]

In the Math technique While explaining the theory you used the condition of 2 first hence it was justified to use the condition 4 next (as it is the only option left) but in the code you wrote the condition of 4 first then 2 . how is it justified?

[@abhinay.k]

thanks

[@gyaniyoda4608]

wow

[@harshal8781]

aryan bhai i 1st wrote top-down approach it gave TLE and when I converted it to bottom up it passed all the TC and got accepted too. But as you mentioned both have the same TC and SC so how its possible?

[@me-16ayushverma40]

bhaiya from where u know abt this theorem....

[@joydeeprony89]

bro one suggestion go little slow

[@cursed_nerd]

Use 0.75x

[@samagraagrawal5333]

Does the interviewer expects us to know these theorems?

[@rajrajesh1669]

I think no... Not every problem can be solved using theorems, But when we have a choices based problem and if we can break a bigger problem into sub problems then DP works for everything. I think, for this problem, 1D dp solution is more than enough.....

[@harshal8781]

@@rajrajesh1669 agreed :)