### YouKn0wWho's blog

By YouKn0wWho, 3 years ago,

This post took $4$ years to make. And this is the most significant thing that I have ever shared in my whole life.

#### Story

Hi, I have been doing CP for like $4$ years and from the very beginning what I have been feeling is a need for a comprehensive topic list that will contain all sorts of topics from easy to advanced with corresponding tutorials, problem lists and templates so that I wouldn't have to look at different sites, from here to there. So what do you do when you think something is missing from the world? Yeah, you create that thing! So here I am, sharing the ultimate topic list that you will need in CP.

When I say that it took me $4$ years to make it, I genuinely mean it. I have been collecting them from the inception of my CP journey and yesterday I thought that it got its almost complete shape. You may not imagine the sheer excitement hidden under each of the characters of this post.

#### Payment

You can pay me just by upvoting this blog and by being a better programmer and human being than what you are right now.

I have added a few tutorials for each topic. You can also find more of them by just using your best companion — Google.

Added few problems for each topic. But you may notice that some of the topics don't have any problem attached. That's because under the attached tutorial section you will find lots of problems with that topic. If you want more problems, then you can do it just by using Google.

I have attached my template for each topic. You may not call it a template because some of them don't support the generalized use of the topic. But you can use them easily if you understand the topic and solve problems using that template.

Lastly, I tried to state the difficulty of each topic by numbers from $1$ to $3$ so that people can understand what are the best topics for them. The distribution is as follows:

• $1$ — If your rating is $1600 - 1899$
• $2$ — If your rating is $1900 - 2399$
• $3$ — If your rating is $2400+$

If you are a beginner then just learn basic topics and solve problems.

#### Contribute

You can comment the topic names that you think are missing right now and I am pretty sure some links are broken, do point those out if you find some.

I really wanted to post this blog before I die. Seems like I managed to do that. It's funny that I had this constant fear of what if I die before sharing this blog with the world given that the amount of work I have given to create this is monstrous. But now I am so happy that I am alive at this moment.

#### Conclusion

The whole purpose of this project is to help you with this astounding journey of you trying to be better, trying to achieve the best of what you can imagine. Hope that my efforts won't go in vain. I am waiting to see you at the top of the building that you made by the bricks of your expectations. I am waiting to see you smile and to be happy. Don't forget to enjoy the journey and have fun while riding the boat.

Best wishes, my friend .

• +4383

| Write comment?
 » 3 years ago, # |   +32 Great blog vai
•  » » 3 years ago, # ^ |   0 What is vai ?
•  » » » 3 years ago, # ^ | ← Rev. 2 →   0 vai means 'brother'
•  » » 3 years ago, # ^ |   -9 Its bhai, vai kya hota hai
•  » » » 3 years ago, # ^ | ← Rev. 2 →   +11 In bengali the pronunciation is more like 'vai'. 'Bhai' is more likely hindi or urdu pronunciation.
•  » » » 3 years ago, # ^ | ← Rev. 2 →   +14 sanuk2540 It will be "It's", not "Its".
 » 3 years ago, # |   +37 You sir are a hero we don't deserve. Thank you very much for your amazing contributions to the community.
 » 3 years ago, # |   +131 orz
 » 3 years ago, # | ← Rev. 2 →   0 Orz , One of the best blog ever with all the details cleanly presented
•  » » 3 years ago, # ^ | ← Rev. 3 →   +3 It's currently the 3rd most upvoted blog on codeforces!
•  » » » 3 years ago, # ^ |   0 Which is first?
•  » » » » 3 years ago, # ^ |   +3
•  » » » » 17 months ago, # ^ |   0 now, it is 1st
•  » » » » » 7 months ago, # ^ |   0 Update : MikeMirzayanov's blog (Please, read this) it's now the most upvoted blog
 » 3 years ago, # |   +1 Bhallagse!!!!
 » 3 years ago, # |   +1 This is amazing!!!! Thank you for all your efforts. But would you like to discuss, which ones we actually need? Being a cyan, I certainly don't need all of them, at least not now. Same goes for the greens and below.
•  » » 3 years ago, # ^ |   +19 I have mentioned the difficulties of each topic.
•  » » » 3 years ago, # ^ |   +1 Thanks YouKn0wWho!!
 » 3 years ago, # |   +30 I hope I'd be able to cover most of the topics in this list before I die.
 » 3 years ago, # |   0 Many Top coders of Bangladesh are scared to share their resources templates, etc..... Great to finally get someone like YouKn0wWho who shares without any hesitations. Take love bro.
•  » » 3 years ago, # ^ |   +32 Well, many of them gathered and or created their library bit by bit and learnt throughout the whole process. For the perfect code sometimes several trials are needed. When you just get a full library you can't actually realize how much effort is needed for that. What Shohag vai did is really amazing. But if he didn't you couldn't blame him for that.
 » 3 years ago, # |   +3 This blog is life saver. You deserve unlimited upvotes for all your effort.
 » 3 years ago, # |   +3 would be better if you could also add the order in which these topics should be studied
 » 3 years ago, # |   +8 YouKn0wWho ?? Yes, i know! You're the best. Thank you brother!
 » 3 years ago, # |   +4 This blog deserves constantly 4 years upvoting.
 » 3 years ago, # | ← Rev. 2 →   +1 "From the very beginning what I have been feeling is a need for a comprehensive topic list that will contain all sorts of topics from easy to advanced with corresponding tutorials, problem lists and templates."Every Competitive Programmer Ever: "Highly relatable." Thanks a lot vai. May Allah reward you.
 » 3 years ago, # |   +19 This is just gold! Thanks a lot!! Not all heroes wear capes.
 » 3 years ago, # |   +38 This is called the real contribution
 » 3 years ago, # |   0 It is just awesome. Thanks for helping us...
•  » » 3 weeks ago, # ^ |   0 vai, pupil ta taratari hoye jan finally. best of luck
 » 3 years ago, # |   +5 Well ,now I am confirmed that you are an alien!!!!!!!!!!
 » 3 years ago, # |   0 Advance congratulations for becoming one of the top contributors in codeforces!!!! <3 <3
•  » » 3 years ago, # ^ |   +3 And congratulations again!!!!
 » 3 years ago, # |   +5 Let's push him to the top 10 contributor's list. This blog is a real gem.
•  » » 3 years ago, # ^ |   0 Update: It's been done. They're now 3rd (and rising) top contributor!
 » 3 years ago, # | ← Rev. 2 →   +21 This deserves to be the most upvoted post ever.
 » 3 years ago, # | ← Rev. 2 →   0 This is going to be one of the top 10 upvoted blogs on Codeforces!!
•  » » 3 years ago, # ^ |   0 *top 1
 » 3 years ago, # |   0 Respect ++ for u!!! thanks a ton
 » 3 years ago, # |   +15 This is a competitive programmer's paradise. Really appreciate the time and effort put to build the whole compilation of blogs and most importantly codes to reference!
 » 3 years ago, # |   0 Nice!Thank you!
 » 3 years ago, # |   +1 OPYouKn0wWho orz
 » 3 years ago, # |   0 This will help a lot of people. May god bless you.
 » 3 years ago, # |   +33 I think using spoiler might be a good idea :|
 » 3 years ago, # |   +2 This deserves to be Pinned on the Home Page.
 » 3 years ago, # |   +41 plug dp
 » 3 years ago, # |   0 Should learn topics difficulty wise? All type of topics difficulty-1 then 2 and so on?
 » 3 years ago, # |   +20 This is awesome. Thanks a lot for your efforts and contribution.I wish MikeMirzayanov would allow this post to show on the CF home page!
 » 3 years ago, # | ← Rev. 2 →   +3 Good work Shohag. But I think it will be much better if the problems are sorted according to their difficulty into all categories. Carry on brother.
•  » » 3 years ago, # ^ |   +18 Actually I thought about this but lets say there are 5 variations of Segment tree of varying difficulties. So I wanted to state them at one place so that if someone wants to master Segment tree he doesn't have to check the whole blog to know of the existence of other variations.
•  » » » 3 years ago, # ^ |   +3 Yeah,got your point.It's just my opinion.
 » 3 years ago, # |   0 Simply brilliant !
 » 3 years ago, # |   0 121 LCA in O(1) has broken code link
•  » » 3 years ago, # ^ | ← Rev. 2 →   +6 Actually, In between URL If there is a parameter ex: (')(")(+) then the link will be broken. Because it's a kind of SQL Injection threat. You can check YouKn0wWho's personal Blog post here
 » 3 years ago, # |   0 Orz
 » 3 years ago, # |   0 Great job indeed!!
 » 3 years ago, # |   +6 some blogs should be pinned in blogs list, and this is one of them thank you
 » 3 years ago, # |   +4 now I am excited and depressed at the same time
 » 3 years ago, # |   +4 You have everyone respect Mr. YouKn0wWho
 » 3 years ago, # |   0 Great blog.
 » 3 years ago, # |   +1 Great blog. One question though. Do you know all these topics? If not then how did you decide their difficulty?
 » 3 years ago, # |   +6 I am commenting as an attempt to push this blog to recent actions for others to know/utilise this blog
 » 3 years ago, # | ← Rev. 2 →   +1 i upvoted you with 12 accounts of mine :D thnx a lot and congrats youknowwho( didnt want to ping him unnecessarily) to make to the top 10 contributors
 » 3 years ago, # |   0 This deserves a million upvotes.
 » 3 years ago, # |   +8 Wow
 » 3 years ago, # |   0 Now this is REAL contribution.
 » 3 years ago, # |   +75 Is this the list of stuff that I do not know
 » 3 years ago, # |   +17 YouKn0wWho Please add fracturing search to the list. There is a nice problem of this topic at the last educational round 1574D - The Strongest Build.
•  » » 3 years ago, # ^ |   0 what's "fracturing search"?
•  » » » 3 years ago, # ^ |   0 It's something that @Resende knows and you don't:)
•  » » » 3 years ago, # ^ |   0 Suppose you want to find the k-the best configuration of some object. Fracturing search allows you to visit all k best configurations, even if your search space is huge as k is in the complexity. Fracturing Search Tutorial
 » 3 years ago, # |   0 Thanks a lot brother ,now this blog is going to be bookmark for most of us.
 » 3 years ago, # |   0 Sum of The Number of Divisors in cbrt(n) link of code is not working btw thanks a lot .
 » 3 years ago, # |   0 Congrats brother for being top contributor <3 and thanks for the list <3
 » 3 years ago, # |   0 This will take: Spoilertime...
 » 3 years ago, # | ← Rev. 2 →   +57 If it isn't too much of a hassle, could you please put the lists into separate 'spoiler' tabs? i think it would greatly improve navigability! The long lists (for which i am very thankful) are quite tedious to travel..Thanks a lot for your effort!!
•  » » 3 years ago, # ^ |   +18 Done
•  » » » 3 years ago, # ^ |   +45 I think koderkushy meant something like Category: Basics... Category: Math...instead of one big spoiler.
•  » » » » 3 years ago, # ^ |   +6 I did the appropriate changes for this but when I try to post the blog it shows 504 gateway time-out (I tried 5 times). Maybe that's because the raw HTML file contains almost 200k characters.
•  » » » » » 3 years ago, # ^ |   +24 That's a pity.But then I think there is no reason to hide everything in one big spoiler. That's the main part of the blog.(also, amazing job!)
•  » » » » 3 years ago, # ^ |   +23 I think finally I did it but not here :(.
 » 3 years ago, # |   0 orz
 » 3 years ago, # |   +3 I really have to say that this is some real good work.Thanks.
 » 3 years ago, # |   0 I haven't ever seen such a big list of CP topics. orz.
 » 3 years ago, # | ← Rev. 2 →   +1 🆃 🅷 🅰 🅽 🅺 🆈 🅾 🆄You really deserve a 🏅 .
 » 3 years ago, # |   +1 orz, bookmarking
 » 3 years ago, # |   +11 I suggest adding Konig Theorem in Graph Theory section, here is a good resource about it.
 » 3 years ago, # |   -38 useless trash
•  » » 23 months ago, # ^ |   -14 is you
 » 3 years ago, # |   -19 What should be the order in which we should do these topics as I am going for placement in 2 years so There is not much time for me to learn all these topivd....though I find competitive very interesting and I m not gonna leave this throughout my career but for sake of practical thinking...please guide me to reach up to 1600 rating
•  » » 3 years ago, # ^ |   +20 For $1600$ I don't think you will need to learn more than the basic stuffs.
•  » » » 3 years ago, # ^ |   0 Thank you so much sir
 » 3 years ago, # |   +2 please drop a payment option.! it is more thn expensive! X|
•  » » 3 years ago, # ^ |   +3 I agree, a donation option should be available, considering the huge work.
 » 3 years ago, # |   0 thank bro
 » 3 years ago, # |   0 I also wanted to point out that the link for matrix exponentiation problem is taking me to FTT problem. maybe you put a wrong link there by mistake. It is a little misleading so I would recommend removing that.Thanx for this amazing blog.It is really helpful
 » 3 years ago, # |   0 Is this the most upvoted blog ever on codeforces?
•  » » 3 years ago, # ^ |   0 Nah, rng_58's retirement blog is still on top I guess, and by a huge margin.
•  » » » 3 years ago, # ^ |   0 You are right. But this blog is on 6th place right now and is raising up: it's really worth to be the most upvoted one
•  » » » » 3 years ago, # ^ |   +1 It is now!
 » 3 years ago, # |   0 Great blog Brother. At first, I thought these are all very advanced topics and I really should not learn new topics, as I already learned and practiced so many algorithms that I never used, or could use/implement, or even need at the level/rank I am currently in. But then again, while scrolling through the blog, some topic names caught my attention, which I could not resist learning. I tried to know more about Matrix Exponentiation, range BIT, and today while solving random problems, I even got the chance to implement range BIT!(BTW pls suggest to me some more interesting topics from the list, that I will face more frequently in the future)
 » 3 years ago, # |   0 Curious if this blog is the most upvoted thing on codeforces?
•  » » 3 years ago, # ^ |   0
 » 3 years ago, # | ← Rev. 2 →   0 YouKn0wWho vai, 147 — Johnsons Algorithm, Code template is not working. Can you please fix it?
 » 3 years ago, # |   +13
 » 3 years ago, # |   0 Thanks a lot for soo much of efforts bruv. BTW , the thing I am the most curious about is how your college's name is the same as your name. Any chance that it's your own college?
 » 3 years ago, # |   0 Thanks a lot for this blog. I have made a resolution to complete this list in next few months (7-8 months).
•  » » 3 years ago, # ^ |   +137 That's a bad idea. This is a huge list and many topics are very advanced.Practicing CP is about understanding algorithms and applying them yourself, not just about reading an article. It takes time.
•  » » » 3 years ago, # ^ |   +1 Then I will just practice questions according to my current level (as you suggested in YT videos) and study these topics as I encounter them. BTW thanks for guidance.
 » 3 years ago, # |   +8 If you are too lazy like me to come to this great blog every time you want to learn something, you can refer to this PAGE visually sorted by color too. Have a great learning!
 » 3 years ago, # | ← Rev. 2 →   0 great work in this question I used your hashing code and according to me time n^2 * log(n) but still getting tle in 76 test case question link :- https://mirror.codeforces.com/contest/113/problem/B
 » 3 years ago, # |   0 that's great!
 » 3 years ago, # |   0 Great list of all topics. But I think difficulty is wrong for many entries. 1 is set for those which is hard for me (I had 2200 maximum rating, and now I have 2066). And there are other cases.
 » 3 years ago, # |   +11 Thanks guys, this is now the most upvoted Codeforces blog ever!
 » 3 years ago, # |   0 The click here link in Topic list section is not working
•  » » 3 years ago, # ^ |   0 Yeah, it's not working:/
 » 3 years ago, # |   0 It's just me or the topic list is empty ? (well I will just see this as a chance to visit your great blog)
•  » » 3 years ago, # ^ |   0 The list is not visible to me too
•  » » » 3 years ago, # ^ |   0 His blog is worth a (many) visit so this is actually good, if there is a list above people won't check his post in blog that will be updated
•  » » » » 3 years ago, # ^ |   0 You are the best!
•  » » » » » 3 years ago, # ^ |   0 Ghê
•  » » 3 years ago, # ^ |   +8 ultimate overflow
 » 3 years ago, # |   0 This is going to be at the top of my bookmark lists. Very well organized resources. Thanks a lot!
 » 3 years ago, # |   0 i have accessed to the blog few times ago but yesterday i've been noticed that "this page isn't working right now". Anybody like me ?
•  » » 3 years ago, # ^ |   0 Its fixed now, thanks.
 » 3 years ago, # | ← Rev. 2 →   0 Thanks for the list. Only one problem IMO, a lot of the topics are way too hard relative to the rating that they're assigned. For example, who needs to learn about prefix automation or dinic's algorithm as an expert?
 » 3 years ago, # |   0 this site is not working ..
•  » » 3 years ago, # ^ |   +1 Sorry for the inconvenience. Seems like my email verification was pending and I have just done it, so the site will automatically be activated within 24h.
 » 2 years ago, # |   0 Excellent resources. Thanks!
 » 2 years ago, # |   -6 Sorry but it is possible to make the site available without running JS?
 » 2 years ago, # |   0 orz
 » 2 years ago, # |   0 You Are Amazing
 » 17 months ago, # |   +8 Long live @YouKn0wWho
 » 15 months ago, # |   0 Helpful blog. Thank You
 » 12 months ago, # |   0 Hey, any help for 1200 rating people!?
 » 12 months ago, # |   0 Best !!
 » 11 months ago, # |   0 ma shaa ALLAH great content vaijaan
 » 7 months ago, # |   0 [If you are a beginner then just learn basic topics and solve problems.] Is there any specific guideline for the beginners?
•  » » 7 months ago, # ^ |   0 According to me you shouldn't solve only easy problem. You should try harder problem .. I mean you should try those problems which will take more than 45 minutes or 1 hour to solve to you....I apologize for my bad English ;(
•  » » » 7 months ago, # ^ |   0 On last few month, i try only 1000-1300 ratting problem for practice. And i read different books, articles about data structure and algorithm's. Should i add something more to improve myself?
•  » » » » 7 months ago, # ^ |   0 If you can solve 1100-1300 rated problems within 40-45 minutes then you should try 1300-1400..
 » 5 months ago, # |   0 dear brother keep going I hope you will be top of Bangladesh
 » 9 hours ago, # |   0 I'm trying to improve my Competitive Programming skills this summer. Thanks man you are a savior
•  » » 5 hours ago, # ^ |   0 .ComplaintFrame { display: inline-block; position: absolute; top: 0; right: -1.4em; } .ComplaintFrame a { text-decoration: none; color: #ff8c00; opacity: 0.5; } .ComplaintFrame a:hover { opacity: 1; } ._ComplaintFrame_popup p, ._ComplaintFrame_popup button { margin-top: 1rem; } ._ComplaintFrame_popup input[type=submit] { padding: 0.25rem 2rem; } ._ComplaintFrame_popup ul { margin-top: 1em !important; margin-bottom: 1em !important; } بووووووووووووووم عبد المنعم و هدف قاتل قاتل
 » 5 hours ago, # |   0 Nice blog.
 » 5 hours ago, # |   0 BEST