L6. Sieve of Eratosthenes | Maths Playlist

Notes/Codes/Problem links under day 8 of A2Z DSA Course: takeuforward.org/strivers-a2z...
Entire playlist: • Maths Playlist | Langu...
Follow us on our other social media handles: linktr.ee/takeuforward

[@keshavbadhekar]

Sieve of Era&%#.... something like that🤣🤣🤣
Nice Solution👍
Understood

[@rishujeetrai5780]

So we did all that to decrease the TC from O(N*sqrtN) to O(N*sqrt(sqrtN) + 2N) and gained an additional SC of O(N) which is actually pretty impressive when it comes ridiculously large values of N.
For example, for N=2^32, first approach will do 2^48 operations while the latter will do 2^42 operations, which is a great deal lesser than the first one.

[@stith_pragya]

Understood........Thank You So Much for this wonderful video.............🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@pmanideep39]

Your explanation is much better than Leetcode editorial

[@trailblazer555]

Understood; I'm improving my thought process in every video; Thank you bro;

[@codeman3828]

Great explanation. Understood

[@ipshitatandon5134]

Such a nice method!

[@jivrajsinghshekhawat]

Thanks brother, you have got very nice teaching skills

[@saicharanthammi143]

Excellent explanation sir

[@Therealtalk123]

Nice effort sir.. 👌 😊

[@taqimustafa7665]

Arrays.fill(prime,1) in java

[@reddygopichand2002]

Understood ❤

[@2amCoder]

nice !

[@AkOp-bf9vm]

IF WE INITIALISE VECTOR LIKE { vector arr(n+1,1)} DOES IT STILL CONSIDERED AS O(N) TIME???

[@kshitijjha6737]

Yes as it is not exact time taken.. It is just an asymptotic notation of time taken, an assumption of how fast the code will run.

[@sanchitsanyam7359]

Striver Sir , i am your Jabra fan

[@yashkalia2311]

Great

[@chiragbansod8252]

understood

[@user-vg5tz5lu9e]

Sir I visited your website after Harkirat sir's webinar, But I can't able to singup in takeuforward website also no content showing loading AToZ - DSA page, why is it sir, help me out

[@drishtirai864]

Understood :))

[@Shivi32590]

thank you

[@vipuljamod4119]

Waiting for string playlist...,

[@tharungr7701]

understand sieve of eras thaas theens :)

[@muhammadfarhaan6951]

Can you please bring a video on How to actually derive the time complexity based on maths, that'll be more helpful.

[@jayant9416]

already have a vdo on his channel

[@hashcodez757]

just watch his lectures and in each one he explains in depth....aise hi seekh jaoge bhot kch.....same as me

[@codevibez2023]

When it will be complete?? I am confused to start . I am thinking to start this series but when it will completely end of this batch

[@codeman3828]

Hey i know i am late but just an advice. Start with the A-Z sheet as soon as possible without waiting for it to be finished. Striver has left only 4-5 topics but rest 13-14 are there with detailed explanation. If you are in college trust me you will never get this time back again. It will be very hard to study DSA along with job. I am working professional and it is very difficult to study when you are tired because of work and only have weekends to study long. So fight your procrastination and start studying. All the best

[@codevibez2023]

@@codeman3828 thank you for your kind advice..

[@user-oz2eu7rs8v]

@@codeman3828 Really appreciative

[@28deekshitha.b78]

Why the array has taken n+1

[@Kumaar_Ritesh]

For n = 31, we get an indexing till 30 right ? So, while printing the indices we have elements till 30 and not 29, that has been done. Hope it's clear now.

[@tej.askamble]

31/05 Revise

[@adityabirdy8996]

Sir i have just started a2z how much time should it take to complete

[@ravindrarangwani102]

It would take around 3-4 months
If you study 4 hours daily

[@sainathpatil2674]

if n is as big as 10^7 it will give TLE

[@animefan4841]

nahh it will not

[@abhinanda7049]

understood

[@anshgupta8860]

understood

[@shashankvashishtha4454]

understood

[@hardikpatel352]

understood

[@shaiksoofi3741]

understood