GCD and LCM using Euclid's Algorithm With Applications | CP Course | EP 53 

When will you get 1M subscribers......deserving for this course 😭😭

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❤️❤️❤️❤️❤️❤️

Bhaiya You are the best teacher for cp in the whole RU-vid ❤️❤️ .

the way he simplifies things is amazing!!

beeeeeeeeeeeeeeeeeeeeeeeeeest yarrrr bhai itna jyadda interest kabhi life me nhi aaaayaa koi video dekh kar you are god of competative programming!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

*More than helpfull !!!* *Take this series of CP to the next level* 🔥

thank you..... I thought i will never understand euclid's algorithm.... thank you so much!

the way he simplifies things is amazing!! 25 - Feb - 2022

nobody would have explained this better , thank you

This was simply amazing...the explanation is so good....so easy

superb !!! best explanation and logic ever!!

AWESOME EXPLANATION FINALLY I GOT IT

This is the most perfect course for beginners in competitive coding Very very thanks to you ❣️❣️

This is the best playlist of RU-vid in competitive programming. Keep it up luv vai. Love from Bangladesh. Please make video on binary trees.

code is amazing finally i got that concept which is never forgettable.

Take this course to next lvl

This video makes me understand in a simler way , ThankYou

you taught so good in this concept , finally understood gcd😍😍

Best of best 🔥👍

thank you so much for this video Luv bhaiyaa!!

Great content with consistency

Your videos are always awesome 😎

Thanks!

thanks vai, love from Bangladesh

next level teacher and next level content

Sir pls thoda frequency bada do videos ki kaafi wait karna padta hai aapka, pure week

best gcd explanation

Finally understood ❤️

Best video bhai.

GOD LEVEL TEACHING 😵😵

your explanation awesome.. and very easy to understand

Thank you ☺️

Thank you sir... Today i got a question in CodeChef which required GCD looking for its explanation. Truly blessed with gaurdian angel

One of the good question is CF round 729 c really good question

Vhi more video want for this algorithm topics 😍😍😍share done

Thanx bhaiya

Very informative video bhaiya , pls continue the series .❤️

Requesting More videos on algorithms!

thank you bhaiya this video was of great help...

Nice work

Great keep it up 👍🏻

Excellent explanation 👌 👏 👍 Keep doing bro

Thank you bro this was very helpful video

Thanks bhai 😊

pura clear ho gaya

I have a request plz make this course with some specific playlist, like for number theory topics extra playlist,for combinatoric extra playlist...etc

Best explanation

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

You are doing a great job

Really Appreciable .

Thank You.Your are the best .😀

ahhh great work man

Nice explaination

❤️❤️ mst samjhate ho bhaiya ❤️

Bhai, I am requesting u to start GRAPH Data structure, I want Dijktra's , Bellmon, Primes and Kruskal algo videos.

Very informative bro

Amazing video ❤️ Keep it up 🔥

clear sir i am also confused in this

Best RU-vidr

Blooper kha hh bhai😂😂 Nice video😊

I LUV YOU BRO

You are awesome sir

Waiting for matrix exponentiation 💓💚

Thankyou so much

Thanks luv bhai🙏🙏😊

a very very thanks to you

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

Beautiful!!!

Thank you

CODE USED: #include using namespace std; int gcd(int a,int b) { if (b==0) return a; return gcd(b,a%b); } int main() { cout

Op🔥

Bhai...which IDE you are using

wonderful

Nice video.

🔥🔥🔥🔥🔥🔥🔥

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.

Bhaiya yeh puri cp ki series kab tak khatam kardooge aap?

❤

Great

Wow

Where is it bro? Is it IUT?

How many more are remaining??

Algorithm ka or video cahe hea

op

😇😇😇😇😇

Help me sir my Facebook account was hakad

1

i miss the bloopers

Thanks Bhaiya

I have a request plz make this course with some specific playlist, like for number theory topics extra playlist,for combinatoric extra playlist...etc

Op 🔥

Algorithm ka or video cahe hea

Algorithm ka or video cahe hea

Algorithm ka or video cahe hea