Sir mujhe es course ke bare pta lga. Mai nit jamshedpur ka first year student hu metallurgy branch bhaiya mai bahut pichhe hu apka course follow krna start kiya hu . Thanks sir es course ke liye bahut sahi samajh aa raha hai aap to next lable teacher ho mujhe coding ka aisa teacher nhi mila jo aap ke jaisa explain krta hu Love you 3000times❤️❤️❤️❤️❤️❤️
beeeeeeeeeeeeeeeeeeeeeeeeeest yarrrr bhai itna jyadda interest kabhi life me nhi aaaayaa koi video dekh kar you are god of competative programming!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
Hi sir, As this year's placement season will begin soon, can you please make more interview experience videos for different companies. It will be really really helpful . Thanks
There is one problem in this code , when calculating gcd of (4, 0) this code fails , but the answer should be 4 so , we have to write a if condition to prevent failure of this code
Proof of log(N) complexity is not very clear to me from the example mentioned. You said if we take one number as 2, when we will have maxim recursive calls. I don't think so. For ex: a= 2, b=31 b%a = 1 Recursive call ends after 2 iterations only.