Sir, you are doing great work. Thank you so much for all the content that you are providing. Just wanted to ask you if you are going to cover graph theory(bfs,dfs,etc) in this course too. If yes, what is a tentative date?
@@iamluv could you make one short videos if you get time on like how to give a contest, which contest should we participate long or short, how to axcel fast..and stuff like that for complete begginers.. ♥️
you cannot find all primes uptill 10^18 just like that.. most of the questions where larger prime numbers are required often have special cases, like you could be asked to find prime numbers between 10^15,10^15+10^5 in which case you can use segmented sieve, or you might need to check id a large number is prime or not for which you can ise miller rabin and there are many more cases. so there will always be some special conditions..
bhaiya ap boht bura padhate ho.....itna buda itna buda ki apke channel se hi pyar ho gya............................ ab to yehi sab sollution milta hai 😅😅😅
Everyone has different teaching style but yours is just awesome ❤️❤️
Jo first for loop tha. Usme tum i
Int variable hai so square kiya to overflow ho sakta hai
Dil se accha lagta hai ,jab log doosro ke liye itni mehnat krte hai...
God bless you bhai ,humesha khush raho aap ❤❤❤
Bhaiyaaaaa thankss, recommended on my feed,learnt in 10 mins,easy to understand,must watch!!
Your content is highly ordered bro...luv u luv bro.
bro where are the bloopers, the one in which u had shown the time (morning) motivates me .
Beautiful cpt, lvd it. Thanks for explaining in such an easy way.
Lots of love. 💫💫💫💫💫You are the best teacher.
Great video bhaiya! 😇
Waaa... kya optimize code..❤
Thank-you wonderful explanation.
Video was very helpful for me, thanks a lot sir 🙏
Thank you bhai, your videos are very very beneficial ❤️
Best cp course on utube😊😊
loving it ❤
Bhaiya, please make a video on Chinese Remainder Theorem.
I love your explanation ❤️
great explanation, subbed
Luv bhai is doing great job
Ek din unka mandir banaunga!
luv bhaiya ki jai ho
Thank you bhai, u r the best🔥💯
Luv bhaiya thanku for such content ❤️
Thoda complex laga ye Algorithms, but explanation was really awesome!!!
😃Interesting😃
Sir please isse continue kijie ga...Love you Sir 🙏💯🔥
Best explanation
thanks bro....nicely explained.
at 8:51 5th line me isprime(n+1,1); hona chahie..
Sir, you are doing great work. Thank you so much for all the content that you are providing. Just wanted to ask you if you are going to cover graph theory(bfs,dfs,etc) in this course too. If yes, what is a tentative date?
here in the loop shouldn't we start with j = i*i instead of j = 2*i
good stuff
👍👍👍👍👍 you're the best
Thanks.
thank you bhaiyaa!!
Very helpful sir.
Bhaiya me bhaiya Luv Bhaiya.
Sir machook mein coding ka liya konsa app use karu??
Thank you bhaiya ❤️
Thanks !
Nice explanation sir ,
O(N^2*LOG N ) hoga na
thank you sir
Sieve algorithm and sieve of erathosthenes same hai kya??
yes
this video is helpful to me
you are amazing
27 march 2022 3:15 pm
Thnku bhiya
iPad me aap konsa note taking app use krte ho ?
Goodnotes
fabulous
Nice...👌👌...
Bhaiya can you say how to improve implementation
Solve mor and more questions
does it work for N=1e9 ??
i think in the second loop, j should be less than N+1( to compare the last element too)
prime number code is wrong for
result 2
how to get all primes below 10^9 ??
This code will get TLE for 10^9.Please reply.
why? t.c is sqrt(n)* logn
sir yeh course kab tak over hogga / complete hogga...... thanks for your initiative
Sir❤️❤️
I don't understand 8 th line🤔😕
Good
Luv bhaiya appke kitne lectures ke badd mai cp ..chodchef mai long wali challange start kar sakta hu
After leaning c++ you can start
@@iamluv could you make one short videos if you get time on like how to give a contest, which contest should we participate long or short, how to axcel fast..and stuff like that for complete begginers.. ♥️
Apne course me string algorithms bhi add kr lo plzzz
Wouldn't you make the world's first prime number generator Python programming, my fastest MMSieve method in the world today?
Bhai please make a video to find prime upto 10^18
you cannot find all primes uptill 10^18 just like that.. most of the questions where larger prime numbers are required often have special cases, like you could be asked to find prime numbers between 10^15,10^15+10^5 in which case you can use segmented sieve, or you might need to check id a large number is prime or not for which you can ise miller rabin and there are many more cases. so there will always be some special conditions..
@@iamluv thanks for reply and also for your beautiful content
👍👍👍👍
i guess second loop me j
❤️❤️🔥🔥
❤️❤️🙏🏻🙏🏻
💕❤️
Iska algorithm
❤🧡💛🧡❤
Luv yaar tum kuch bhi padhao tumko samjhate hue dekh accha lagta hai.......
bhaiya ap boht bura padhate ho.....itna buda itna buda ki apke channel se hi pyar ho gya............................ ab to yehi sab sollution milta hai
😅😅😅
Ni pdhana hai to mat dekh
Thank you sir