 What's up guys, my name is Michael and welcome to my YouTube channel. You know, today, you know, I've just been thinking, I don't actually think people should learn algorithms for competitive programming because I actually spent a lot of my time learning like graph traversals, DFS, BFS was dextras, and like Kruskal's algorithm, Prim's algorithm, and I've spent a lot of time doing that. Then I realized like, because the first two problems and competitive programming actually has nothing to do with algorithms, I don't think this is actually a good use of your time. Because I can't even solve some division to B problems. And even though I do, I could code like Dexter's algorithm pretty decently. So I don't think just like knowing algorithms is going to help you to increase your ranking. So I think like, if I were to give some tips to beginners, just like me, because I'm also learning, I would say actually just attempt a lot of virtual contests and just up solve problems, A, B, and C. And then I think the only algorithm you really need is just binary search, I think prefix some, and then that's it. I don't think there's much algorithms you really need. Maybe like, once in a while, you might have to do a bit wise, but even then that's not really, it's not really algorithms, you know what I mean? It's like, you could learn that while you're doing the contest. But yeah, I wouldn't suggest learning like graph algorithms immediately, because that's not going to increase your competitive programming ranking. But yeah, because like I can't even get to green, even though I do know some algorithms. So yeah, I hope you guys enjoyed this video. This is a really short video. Rate, comment, subscribe. I'll check you guys later. Peace.