 What's up guys Mike the Coder here today? You know what? I had this comment the other day saying that the reason why I didn't improve my Competitive programming ranking was because I wasn't using Lee code properly and to that I'm gonna say yeah You might be right because I did a lot of easy's and like 84 mediums But when I was to look back at it a lot of the mediums I did were just array problems So that could be a reason why I didn't improve at all in competitive programming because not all Problems are array problems in competitive programming. So maybe that's the reason why I didn't improve at all So, you know what now? I think about it I'm gonna make this video today is just gonna talk to you guys about how to actually use Lee code improve competitive programming Okay, because I wasn't practicing properly All right, so first of all in competitive programming Lot of problems like the first two first two problems are probably math All right math or greedy. So let if you want to improve in competitive programming Let's say if you want to use Lee code instead instead of using code forces What you could do is you could go on these lists of topics, right? And then you click on math and then you do what you here's what you do Okay, you're gonna you're gonna sort this by hard to easy Okay, you're not gonna sort it by easy to hard You're gonna sort of a hard easy what you're gonna do now is you're gonna pick one easy question One medium question one hard question. All right, so you just pick like I don't know this one I don't know idea this one and make sure that there's more thumbs up than thumbs down It's like this one has a lot of thumbs up So you pick that the problems that have a lot of thumbs up because the ones are a lot of down votes They're pretty bad. So what you're gonna do is now is you're gonna do one easy one medium So like just now that was a medium, right? The other one was a medium. So do that medium question then do an easy question right and then Yeah, just pick any easy question try to do it make sure they have a lot of upvotes and then do one hard question Okay, so like I tried it might be it doesn't have to be super difficult to super duper hard But it could be like I don't know this one the probability of two balls having. I don't know distinct balls or something Oh, no, this is this is bad That's a bad question. But yeah, basically do one easy one medium one hard for math problems Okay, and then after that a lot of competitive programming also does a lot of greedy algorithms So if you want to do practice math and do greedy So now we go to greedy and then just do one easy one medium and hard also So just do like co in here and just do a medium. I don't know. It could be anything I don't know Split split array into consecutive sub sequences. Yeah, do do one of these right? That's a lot of upvotes, right? try doing this one Then try doing an easy That's that was a medium, right? And then do do a hard and then do it easy, right? And then that'll just be your greedy section and just Repeat this for like other topics also and then so after you do math do greedy and then do What is another thing that competitive program do in division 2a and 2b? Oh two pointers, okay? So do one easy one medium one hard in math do one easy one medium one hard for greedy and do one easy one medium and One hard for two pointers, okay Then what we're gonna do is we're gonna just gonna rinse and repeat and do actually there's some sliding windows and prefix some So like sliding wheat window Some of those this is a thing in competitive programming also So you could do like one easy one medium and hard for a sliding window also Actually, there's not even that many easy's for sliding window. So just pick like do most of mediums actually. Yeah, do sliding window do Yeah, so do sliding when I do do math and do greedy and do two pointers, okay, and then Once you get to a point where you do like at least I don't know I Don't know like 60 of those maybe if you continue repeating and assuming that you don't actually you don't actually As long as you're not actually like just copying the code actually doing those problems and Sooner or later. I think you'll get pretty good At these certain topics. Yeah, you should be able to do start getting better in competitive programming So that's what I'm gonna try to do from now on If I'm gonna easily code to try to get good at competitive programming and another thing what I'm doing is I'm just if I can't do yeah, yeah another thing I'm gonna do is probably virtual contest But that's another video later on but anyway, that's what that's what I'm gonna try to do from now on to use the code to Get better at competitive program. So I do like a like do math do greedy to pointer and Then do sliding window. We're just sliding windows. I don't even see it Is there a sliding window? It might be something. I don't know. I saw it earlier. I can't find it Yeah, do math do greedy to two-pointer do sliding window and then what was another thing that sometimes pops up in competitive programming? Oh, yeah, a bit bit manipulation that sometimes pops up. So that's like the first division 2a and 2b problems that I normally see Yeah, so I could get better at those and there's also prefix some that comes up sometimes also So like if we do certain topics you get better. I feel like linked lists never show up Maybe counting shows up once in a while, but linked lists never show up heaps never show up I don't know if backtracking ever shows up. I don't know about that Matrices don't show up. Don't do a bunch of array problems. That doesn't show up I think in division 2c's dynamic programming does show up. So you could practice that also, but for me I'm pretty low-ranking at this point where I don't think I'll ever see a dynamic programming question in 2a or 2b So yeah, until I get to the point where I could hit cyan I think I'm not gonna practice dynamic programming until I get to that point But other than that, I think this is that that's a pretty good way to improve in competitive program we do one one Using lead code to get better at competitive program do one easy one medium one hard and then just repeat that for like I don't know 60 problems Then that should give you a gist of how to learn better because what I did before trying to grind a bunch of array problems Yeah, that didn't really help that much Just like wasted a bunch of potential and wasted a lot of my energy like I think that that was just a waste of time Like I did 200 a little one 211 array problems, and then I did like 84 array problems, which got me a little better to arrays, but it didn't actually It didn't it didn't it didn't improve my Competitive programming skills at all because these are just all right arrays don't it doesn't really help you that much so yeah, I would highly avoid doing like array problems and I Would avoid array problems. I would avoid heaps. I would avoid design. I would avoid Link lists avoid union find avoid Avoid try avoid binary search treat that never shows up Um Here you bit masks that shows up bit masking bit manipulation shows up sometimes and I would avoid Psych trees do show up, but that's in like division 2d. So I would avoid that. I would also avoid Rolling I don't know I think I don't think so. I don't think combative Torx shows up sometimes for ad coder But yeah, I would avoid I would avoid link lists merge sort avoided these also So link lists of merge sort bucket sort that never shows up counting short counting sort never shows up and Yeah that's pretty much I would avoid and I don't know what rejection sampling is I don't think I never shows up so those are the topics I would avoid if I'm trying to use the code improvement competitive programming So yeah, that's pretty much the gist of it Yeah, I hope you guys enjoyed this video. I When I said that Lee code doesn't improve competitive programming. I was just using it wrong But I did like there are some topics that are do like coincide with each other. It's just that like it's not that Like it's not that beneficial Why not why not just do code forces? But yeah, that's just me ray com subscribe I hope you guys enjoy this video. I'll check you guys later. Peace