Maths for DSA/CP : All You Need To Know

[@debjitdasgupta5502]

Don't stop the DSA/CP series! Amazing video as usual!!

[@harshpandey4190]

Best Video on number theory by Best of the Community

[@girishbhargava6367]

I really respect the people who add time stamps in their videos

[@sivasainagireddi7956]

Exactly this is what I m searching for for. GREAT EXPLANATION

[@SunilKumarGvBLC]

In 24:03, while explaining sieve of eratosthenes, the upper for loop should go from 2 to i * i

[@utkarshgupta9858]

The time complexity is still the same... Plus my template also stores all of the primes in a vector, so that's why i < N

[@SunilKumarGvBLC]

Got it brother! Thanks for your instant reply!

[@sachinupreti7159]

@@utkarshgupta9858 sun yr, bit manipulation pe bhi sikha de kuxh...

[@justworkfine321]

So you mean constant not matter I*i we get const value and for big o for worst case we can't consider constant so it's complexity O(n) times

[@shantivaranasi231]

@@utkarshgupta9858 can u share related problems of these topics

[@bugSlayer07]

Not all heroes wear capes.. Some make DSA videos on YT. Thanks brother 🙌

[@harshit_gajera]

At 45:50, if b==0, you should return 1; this code gives the wrong answer in some test cases. ex= 9 1 7 Thank you. Waiting for the next video.

[@surajkumar-ze5jl]

I am in mid of CP course of coding ninja and I recently going with topic of number theory and almost mujhay meri kashti dubti nazar aarahi this but is video ne meri kasti sambhal li modulo arithmetic part is awesome for me thank you Utkarsh bhaiya.

[@Atvkaur1111]

CP course is paid or free?

[@anilcoder]

Wow! Modulo inverse and Fermat theorem Explanation I will never forget, ❤❤❤❤.

[@pksk7952]

please make more videos please increase the frequency as this is kind of content we want!

[@shri9229]

He is INDIA RANK 2 Bro

[@sachinupreti7159]

@@shri9229 now 1 🤦‍♀️

[@tessabloomx8660]

hey in your binary exponentiation (pw) function, in the base case if b is 0 then we should return 1 as a^b will become 1 and m is assumed to be greater than 1.

[@utkarshgupta9858]

Yes you're right... I made a typo in the code.

[@Studykrobetaplz]

Oh finally you are back 😊 :))) much more love to you bhaiya

[@AviralDewan]

Bro please make a video on dynamic programming

[@algoJamming]

I think ,he already have some videos on dynamic programming :)

[@SKgaming-qy6gn]

Watch striver's channel

[@satyammishra2783]

Practice

[@tirthasg]

Your explanations are great. Well done!

[@shubhamchidrawar9477]

Awesome video! This is very high quality content, Eagerly waiting for the second part.

[@DeepakKumar-mn7sp]

How to setup sublime like that in 5:30 , the TC part ?

[@saurabhkumarchoudhary1795]

This is the thing I was waiting from past 4 years

[@jayantgupta5310]

Literally bhaiya I was finding this type of video for 2-3 days and nothing got quality content like this Thanks a lot Aapne meri sun li

[@Profnegi]

Today i start cp and learning from grandmaster directly.. like wow this is amazing! Lot of resp++

[@deepakbhoria4172]

thanks for explaining modulo arithmetic in full details !!! great work

[@apoorvamittal4112]

just the person I was looking for, thanks 🙌

[@utkarshgupta9858]

Person or video? 😛

[@anveshreddypinnapareddy3552]

@@utkarshgupta9858 Ig the "person" who can make many such "videos".

[@priyankarai7005]

How come we feel the same ❤️❤️ the one I was looking for

[@ANANDKUMAR-jk9yp]

By the way, time complexity of gcd is log(min(a,b)).

[@shresthjain985]

Crisp and to the point content. Well Done.

[@AkhileshSingh-wq6gt]

Thank you Bhaiya... Modular Arithmetic part taught me something new.. 😊

[@abhishekmore5856]

Really liked your explanations and proofs for n/1, n/2 , n/3, ....n/n = logn Intuition why sieve inner loop starts at i*i and the way you improved the complexity o(n), o(sqrt(n)), for queries o(n*loglogn) Intuition of mod operations ( +, -, *, /) and why / wont work like other. o(1) calculation of inverse m! ( it looked obvious after you explained XD ) m/m! -> 1/(m-1)!

[@theresweet984]

Hola, Utkarsh Gupta! Please keep it up this kind of competitive edu series. Thanks!

[@jitendrakhanna4426]

From where you learn all these things or just while practicing you learn..

[@abhijeetbasfore6816]

Cpalgorithms

[@tusharamreliya5250]

pre rmo

[@aryankumar87771]

for prime approach would this be not much faster ? bool isPrime(int N) { if(N==1){ return false; } int count = 0; for(int i = 1; i*i

[@ritvikreddy3959]

removing the nested if won't reduce the time complexity it will still be O(root(n))

[@himanshu010]

Gread content Grandmaster. Keep uploading. 🤝

[@murtazamister8125]

Modular division at 55:35 for these two cases are not returning equal output, a=48521 b=654 m=17 output : 6 11 a=48521 b=654 m=13 output : 9 11 Is it only happening with me? or they do produce different output?

[@aayushverma5121]

Just the content I was looking for ! Thank you for the video

[@ananyasuryavanshi2800]

Please make one whole video explaining time-complexity also.

[@vivekdhir77]

Nice, bro long time no see. I was waiting.....

[@Manish_Upadhyay]

You are inspiration for me ❤️✨

[@codenchill732]

Please make a video on bit manipulation. Especially on XOR operation

[@yath3681]

yes , please ! everything about bitwise operator questions in CP

[@vtechrepo1927]

after so long wating for this video

[@RahulSingh-nf3dr]

27:50 time complexity should be O(log(min(a,b))) correct me if I am wrong

[@AshishGusain17]

42:21 shouldn't base case return 1

[@zarifishmam809]

at 24:15, can someone explain why he does the primes[i] ^= 1? what does that achieve?

[@Ram-uf8mv]

in pw(a, b, m), when b is 0, why are you returning a % m? it should always be 1 right?

[@utkarshgupta9858]

Oh right yeah... I think I mistyped that part... And the tests didn't fail🤦🏻‍♂️ I hope learners don't get confused. Thanks for pointing out

[@rajukachori9536]

SIR UR DOING GREAT JOB FOR US ...THANKU PLEASE MAKE MORE THIS VIDEOS .WE GET TO LEARN MANY THINGS FROM IT

[@Advebtures-hx4hv]

Please make a video for greedy it is very helpful

[@parthsalat]

Amazing content, as usual!

[@DeepakKumar-mn7sp]

At 23:55 that sieve template, how the whole template code arrives just by typing sieve?

[@TON-108]

In vs code we can save boilerplate codes

[@allmighty2000]

the nlogn proof was amazing

[@tejaswarade3785]

can you please give practice problems on Maths part in DSA

[@dhananjaysharma4379]

very nice explanation, just adding the practice questions related to the concepts would be even better.

[@sandeepsharma2183]

Most awaited video♥️♥️

[@rahul_singh_rajput3292]

Bhaiya plS make video on how to Start for CP.. How should we learn Dsa correcr way

[@abhishekkeshri3974]

Thanks for this. It really helps me a lot .

[@arnabchakraborty246]

Grt video. Please share some problem set to practice

[@codeblooded6760]

Hey recently saw your mock interview with kerthi purswani in which you mentioned that hard ques will most probably be not asked in google interviews. Can you make a detailed video about the difficulty level of ques that can be asked in google interviews with examples of some questions so we can get a good idea about the level of ques asked. Also if you could compare them with respect to leetcode medium and hard questions that would be very helpful. Thanks in advance!

[@jiakai7254]

if you prefer a textbook, consider the competitive programmers handbook :)

[@wondol4486]

This is perfect lecture

[@random_memes009]

Hwy, plz make video on time complexity. Thk yu for helping us

[@manayyadav4911]

Hey, could you please make a video on how to setup sublime text for cp on windows. It's really frustating for windows peeps to execute and run programs.

[@humanbeing6042]

Checkout Luv competitive programing course playlist.The second video completely about setup Link: kzbin.info/www/bejne/kJ3baJqjqZifeLc

[@manayyadav4911]

@@humanbeing6042 I have already seen it. But not able to setup from his way. I am not able to make my custom build file and stuck forever :(

[@johntony366]

You can use WSL to get the linux experience on windows

[@PrinceKumar-uz9xv]

thanks, ❤ bhaiya I wanted this type of video.

[@ascyrax8507]

I used to dread Modular multiplicative inverse. Not anymore 😌

[@AtulKumar-c4x7l]

primality test 3:27 gcd 24:37 modular arithmetic 30:52 pnc 59:04

[@sherlockjunior8612]

Prime or not Prime Number of divisors of each number from 1 to N Sieve of Erastothenes GCD Modular Aritihmetic ( Add, Subtract, Multiply, Pow(Binary Exponentiation), Fermat's Little Theorem to get (1/a)%M we get pow(a,M-2)%M where M is prime number divisor, ) Combinatronics: nCr calculation in linear time using fact and inv_fact array (Usually paired with %M problems)

[@arsh2489]

this video changed my life beta 👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌

[@Nikhil-Tomar]

I don't think +m is required in ((a % m) - (b % m) + m) % m, because even if (a % m) - (b % m) < 0, In this case this value has to be % by the outer m, There it will always reach a positive number.

[@Sandeep-zd6dq]

Bhai mujhe bhi 7 star banna hai 😢 jbse tumhari AIR 1 waali video dekhi hai tumhe follow kr rha hu lekin abhi 3 start bna hu 1 mahine mein😎 jaldi hi seven bhi bnunga

[@cypher7536]

Bro please tell how to make sublime like yours

[@samanwaybarman3316]

Searching and sorting and precomputation

[@rishav144]

kindly continue with Graph series

[@TilakRaj-qo6ic]

Can someone please tell me which software he used to create thie presentation please

[@abhinavkumar5298]

Amazing Video.

[@sahilanand30]

Nice explanation

[@muthupandideivamsanmugam1774]

I have one doubt if we multiply a number it gets overflow and if we add also it gets overflow but if we divide a number how it will get overflow

[@yashkhatwani3198]

Hi Utkarsh how are you getting all that , test , run ,edit , time and stop feature in your editors output

[@shubh4096]

how did you change your codeforces cp handle from healthyUG to demoralizer??? i just wrote without thinking much at that time now i want to change it! how to do it can you tell me plz!

[@abhishekkumar-vk8kc]

Sir please make video on dp and graphs from basic to advanced

[@KunalLadhani]

How did you setup sublime for CP Can you tell pls.

[@anupamdubey5736]

Awesome class!

[@pronoob5664]

Thank you LORD DEMORALIZER

[@sunnykumarsingh7039]

in the mod program, if b==0 we should return 1 or a%m?

[@BRAJESHKUMAR-lz4mw]

Is it possible to right a number in form of 3^x + 7^y where x and y is any positive integer value. We need to return true or false. Can someone please provide a efficient solution for this question?

[@realnight_bot2536]

Are JOD sir 🤩

[@notlinuxneverdies5846]

Thank you sooo much!!!

[@vanquishersgaming138]

You're awesome 🙌

[@chatrughanprasad7778]

Great Lecture Bro!

[@darshanmahankar6626]

The Speed at which complier is working and Set-up is made ....i am desparately waiting when that content would be Up on channel 🙂🤝💔

[@ddnsdeepak8148]

Bro please make a video on your sublime text setup of U .

[@lakeshkumar1281]

simply awesome

[@sakshamgulati5854]

Bhaiya other topics ki bhi detailed videos bana do please jo cp mei important hote hai..🙏

[@crazyteam9370]

Hello brother ! Please make a video on how to setup Sublime text as you had in your laptop

[@ascyrax8507]

24:06 what does "#define SIEVE" do? ps: very helpful video thanks.

[@jeevanalexen]

it prints all the prime numbers till the given n

[@ascyrax8507]

@@jeevanalexen I got that already. I just wanted to know what does this single statement do?

[@utkarshgupta9858]

I have #ifdef SIEVE sieve() in my template... It just saves me 2 seconds and I don't have to write 1 extra line to call the sieve function...

[@ascyrax8507]

@@utkarshgupta9858 got it thanks. what is ur next video gonna be :)?

[@MdMaruf-ln9pv]

sir can you please tell me from where you learned all this topics??

[@Aditya-if3ij]

Purple is my aim for this year.

[@sumeetubale3923]

hi utkarsh bhaiyya ,at time 56 : 00 the code is giving wrong output for input a=156 b = 4 and m = 7 could you plz verify it where I can go wrong !! and thank you so much for this amazing video !! just loved it!! plz don't stop ever to make video related to cp

[@utkarshgupta9858]

i made a small mistake in the code, if power is zero, we should return 1 instead of a.

[@sumeetubale3923]

@@utkarshgupta9858 ok thank you bhaiyya!!

[@algotalk5368]

Please update this slide

[@ffera6611]

please add graph videos also like this one

[@GeneralistDev]

Please share your sublime setup

[@arsh2489]

this changed my cp career ❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤😍😍😍😍😍😍😍😍😍😍

[@rohitjangir8303]

Hey brother can u make a video on how to setup sublime text like you for competitive programming

[@035asadali8]

i thought i know very lesss but after seeing todays video i understand i know all topics he discuss today and even more he not add

[@AjithKumaR-jw9wt]

Where u learn all this things

[@035asadali8]

@@AjithKumaR-jw9wt few days ago and still learning , if u want to understand number theory try code n code number theory playlist

[@AjithKumaR-jw9wt]

@@035asadali8 bro any prerequisite to learn number theory

[@AjithKumaR-jw9wt]

@@035asadali8 what are the topics we want to cover in dsa before cp

[@035asadali8]

@@AjithKumaR-jw9wt for number theory no prerequisite needed

[@simranvedpathak7112]

🔥🔥

[@thilakreddy1904]

can u explain what is O(log)

[@unaizsiddiqui3892]

Brother, i love to watching your video... But i have a problem, why you don't make a video in hindi... Hum bachee hai bhaiya hindii me explain karoo ge to...or ache se samj ayega...and channel bhi fast grow karega...(padhee ga india to badhega india)💫♥️