YouKn0wWho's blog

The Ultimate Topic List (with Resources, Problems and Templates)
By YouKn0wWho, 21 month(s) ago, In English

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.

About the Topic List

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.

Topic List

Link: smash me

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.

Additional Comments

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 blobheart.

  • Vote: I like it
  • +4383
  • Vote: I do not like it

Comments Comments (138)
| Write comment?
»
21 month(s) ago, # |
  Vote: I like it +32 Vote: I do not like it

Great blog vai

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +37 Vote: I do not like it

You sir are a hero we don't deserve. Thank you very much for your amazing contributions to the community.

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +131 Vote: I do not like it

orz

→ Reply
»
21 month(s) ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Orz , One of the best blog ever with all the details cleanly presented

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +1 Vote: I do not like it

Bhallagse!!!!

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +1 Vote: I do not like it

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.

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +30 Vote: I do not like it

I hope I'd be able to cover most of the topics in this list before I die.

→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

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.

→ Reply
  • »
    »
    21 month(s) ago, # ^ |
      Vote: I like it +32 Vote: I do not like it

    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.

    → Reply
»
21 month(s) ago, # |
  Vote: I like it +3 Vote: I do not like it

This blog is life saver. You deserve unlimited upvotes for all your effort.

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +3 Vote: I do not like it

would be better if you could also add the order in which these topics should be studied

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +8 Vote: I do not like it

YouKn0wWho ?? Yes, i know! You're the best. Thank you brother!

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +4 Vote: I do not like it

This blog deserves constantly 4 years upvoting.

→ Reply
»
21 month(s) ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it

"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.

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +19 Vote: I do not like it

This is just gold! Thanks a lot!! Not all heroes wear capes.

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +38 Vote: I do not like it

This is called the real contribution

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +5 Vote: I do not like it

Well ,now I am confirmed that you are an alien!!!!!!!!!!

→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

Advance congratulations for becoming one of the top contributors in codeforces!!!! <3 <3

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +5 Vote: I do not like it

Let's push him to the top 10 contributor's list. This blog is a real gem.

→ Reply
  • »
    »
    21 month(s) ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Update: It's been done. They're now 3rd (and rising) top contributor!

    → Reply
»
21 month(s) ago, # |
← Rev. 2   Vote: I like it +21 Vote: I do not like it

This deserves to be the most upvoted post ever.

→ Reply
»
21 month(s) ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

This is going to be one of the top 10 upvoted blogs on Codeforces!!

→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

Respect ++ for u!!! thanks a ton

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +15 Vote: I do not like it

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!

→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

Nice!Thank you!

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +1 Vote: I do not like it

OP

YouKn0wWho orz

→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

This will help a lot of people. May god bless you.

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +33 Vote: I do not like it

I think using spoiler might be a good idea :|

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +2 Vote: I do not like it

This deserves to be Pinned on the Home Page.

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +41 Vote: I do not like it

plug dp

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +20 Vote: I do not like it

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!

→ Reply
»
21 month(s) ago, # |
← Rev. 2   Vote: I like it +3 Vote: I do not like it

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.

→ Reply
  • »
    »
    21 month(s) ago, # ^ |
      Vote: I like it +18 Vote: I do not like it

    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.

    → Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

Simply brilliant !

→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

121 LCA in O(1) has broken code link

→ Reply
  • »
    »
    21 month(s) ago, # ^ |
    ← Rev. 2   Vote: I like it +6 Vote: I do not like it

    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

    → Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

Orz

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +6 Vote: I do not like it

some blogs should be pinned in blogs list, and this is one of them

thank you

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +4 Vote: I do not like it

now I am excited and depressed at the same time

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +4 Vote: I do not like it

You have everyone respect Mr. YouKn0wWho

→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

Great blog.

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +1 Vote: I do not like it

Great blog. One question though. Do you know all these topics? If not then how did you decide their difficulty?

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +6 Vote: I do not like it

I am commenting as an attempt to push this blog to recent actions for others to know/utilise this blog

→ Reply
»
21 month(s) ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it

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

→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

This deserves a million upvotes.

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +8 Vote: I do not like it

Wow

→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

Now this is REAL contribution.

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +75 Vote: I do not like it

Is this the list of stuff that I do not know

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +17 Vote: I do not like it

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.

→ Reply
  • »
    »
    20 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    what's "fracturing search"?

    → Reply
    • »
      »
      »
      20 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      It's something that @Resende knows and you don't:)

      → Reply
    • »
      »
      »
      20 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      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

      → Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

Thanks a lot brother ,now this blog is going to be bookmark for most of us.

→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

Sum of The Number of Divisors in cbrt(n) link of code is not working

btw thanks a lot .

→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

Congrats brother for being top contributor <3 and thanks for the list <3

→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

This will take:

Spoiler
→ Reply
»
21 month(s) ago, # |
← Rev. 2   Vote: I like it +57 Vote: I do not like it

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!!

→ Reply
  • »
    »
    20 months ago, # ^ |
      Vote: I like it +18 Vote: I do not like it

    Done

    → Reply
    • »
      »
      »
      20 months ago, # ^ |
        Vote: I like it +45 Vote: I do not like it

      I think koderkushy meant something like

      Category: Basics
      Category: Math

      instead of one big spoiler.

      → Reply
      • »
        »
        »
        »
        20 months ago, # ^ |
          Vote: I like it +6 Vote: I do not like it

        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.

        → Reply
        • »
          »
          »
          »
          »
          20 months ago, # ^ |
            Vote: I like it +24 Vote: I do not like it

          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!)

          → Reply
      • »
        »
        »
        »
        20 months ago, # ^ |
          Vote: I like it +23 Vote: I do not like it

        I think finally I did it but not here :(.

        → Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

orz

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +3 Vote: I do not like it

I really have to say that this is some real good work.Thanks.

→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

I haven't ever seen such a big list of CP topics.
orz.

→ Reply
»
21 month(s) ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it

🆃 🅷 🅰 🅽 🅺 🆈 🅾 🆄

You really deserve a 🏅 .

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +1 Vote: I do not like it

orz, bookmarking

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +11 Vote: I do not like it

I suggest adding Konig Theorem in Graph Theory section, here is a good resource about it.

→ Reply
»
20 months ago, # |
  Vote: I like it -38 Vote: I do not like it

useless trash

→ Reply
»
20 months ago, # |
  Vote: I like it -19 Vote: I do not like it

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

→ Reply
»
20 months ago, # |
  Vote: I like it +2 Vote: I do not like it

please drop a payment option.! it is more thn expensive! X|

→ Reply
  • »
    »
    20 months ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    I agree, a donation option should be available, considering the huge work.

    → Reply
»
20 months ago, # |
  Vote: I like it 0 Vote: I do not like it

thank bro

→ Reply
»
20 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
20 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Is this the most upvoted blog ever on codeforces?

→ Reply
  • »
    »
    20 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Nah, rng_58's retirement blog is still on top I guess, and by a huge margin.

    → Reply
    • »
      »
      »
      20 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      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

      → Reply
»
20 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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)

→ Reply
»
20 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Curious if this blog is the most upvoted thing on codeforces?

→ Reply
»
20 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

YouKn0wWho vai, 147 — Johnsons Algorithm, Code template is not working. Can you please fix it?

→ Reply
»
20 months ago, # |
  Vote: I like it +13 Vote: I do not like it

→ Reply
»
20 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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?

→ Reply
»
20 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Thanks a lot for this blog. I have made a resolution to complete this list in next few months (7-8 months).

→ Reply
  • »
    »
    20 months ago, # ^ |
      Vote: I like it +137 Vote: I do not like it

    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.

    → Reply
    • »
      »
      »
      20 months ago, # ^ |
        Vote: I like it +1 Vote: I do not like it

      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.

      → Reply
»
20 months ago, # |
  Vote: I like it +8 Vote: I do not like it

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!

→ Reply
»
20 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

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://codeforces.com/contest/113/problem/B

solution :- https://codeforces.com/contest/113/submission/130230945

→ Reply
»
19 months ago, # |
  Vote: I like it 0 Vote: I do not like it

that's great!

→ Reply
»
19 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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.

→ Reply
»
19 months ago, # |
  Vote: I like it +11 Vote: I do not like it

Thanks guys, this is now the most upvoted Codeforces blog ever!

→ Reply
»
19 months ago, # |
  Vote: I like it 0 Vote: I do not like it

The click here link in Topic list section is not working

→ Reply
»
19 months ago, # |
  Vote: I like it 0 Vote: I do not like it

It's just me or the topic list is empty ? (well I will just see this as a chance to visit your great blog)

→ Reply
»
19 months ago, # |
  Vote: I like it 0 Vote: I do not like it

This is going to be at the top of my bookmark lists. Very well organized resources. Thanks a lot!

→ Reply
»
18 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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 ?

→ Reply
»
18 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

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?

→ Reply
»
18 months ago, # |
  Vote: I like it 0 Vote: I do not like it

this site is not working ..

→ Reply
  • »
    »
    18 months ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    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.

    → Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Excellent resources. Thanks!

→ Reply
»
17 months ago, # |
  Vote: I like it -6 Vote: I do not like it

Sorry but it is possible to make the site available without running JS?

→ Reply
»
14 months ago, # |
  Vote: I like it 0 Vote: I do not like it

orz

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

We are so proud of you shajalal shohag vai;

→ Reply
»
10 months ago, # |
  Vote: I like it 0 Vote: I do not like it

The Great Collection ever. Thank you so much brother.

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Our Icon vai

→ Reply
»
9 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Thank you so much brother.

→ Reply
»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Thank you.

→ Reply
»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Thank a lot, really amazing bhai <3

→ Reply
»
5 months ago, # |
  Vote: I like it +8 Vote: I do not like it

Long live @YouKn0wWho

→ Reply
»
4 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Thank you, was really helpful

→ Reply
»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

The Best Blog I've ever seen in my life..

→ Reply
»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Helpful blog. Thank You

→ Reply
»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Thank you.

→ Reply
»
2 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

How can I get the things you mentioned

→ Reply
»
2 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Where is less than 1600 ?

→ Reply
»
2 weeks ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

So useful blog. orz YouKn0wWho

→ Reply