SHADOW088's blog

Looking for Advice on My CP Learning Path
By SHADOW088, history, 3 hours ago, In English

I've been doing competitive programming for about 2-3 months and have gone through these topics so far:

  • Basics (Conditional statements, loops, switch)
  • Bitwise operators
  • Arrays, Strings
  • Greedy algorithms
  • Linear search, Two pointers
  • Binary search
  • Prefix sum
  • Sorting
  • Number Theory (sieve, modulo, exponentiation)
  • Pointers
  • STL
  • Recursion
  • Basic Probability and Combinatorics

Lately, I've been practicing questions in the 1000-1400 range.

Next, I'm thinking of diving into:

  • Stack

  • Queue

  • Tree

  • Heap

  • Hashmap

  • Trie

  • Backtracking

  • Graph (BFS, DFS, Shortest Path)

  • Dynamic Programming

Does this sequence seem okay? Any tips on how to approach these topics?

  • Vote: I like it
  • 0
  • Vote: I do not like it

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

I have done same topics which u have done with stack and queue extra and believe me just practice this much you can reach 1400+ by this much topics only once u reach 1400 then study dp and graphs before that there will be no use as u will not be able to solve those problems anyway in the contest

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

    What range of problems should I focus on? I find it hard to solve constructive algorithms. Any suggestions for that?

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

I think graph before tree? tree is just a special graph, so understanding graphs first is better in my opinion, the rest seems fine

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

    Thanks! I don’t have much idea about these topics (except Stack and Queue), so Tree should be between Graph and DP, right?

    → Reply