Elkhateb's blog

By Elkhateb, history, 2 years ago, In English

I know basic data structures like an array, vector,pair..etc. I also practice some recursion functions, but not good at analyzing the complexity of my functions!

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

| Write comment?
»
2 years ago, # |
  Vote: I like it +2 Vote: I do not like it

Improve your complexity analysis first, and learn other algorithms such as binary search and prefix sums. Dynamic Programming is an intermediate/advanced topic that requires familiarity with time complexity and common data structures. If you're looking for a general roadmap, consider the USACO guide: https://usaco.guide/. As you can see, even basic DP is in gold, so you should save that until after you've learnt more algorithms and solved more problems.

»
2 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Recursion helps a lot to understand the DP concept.

»
2 years ago, # |
  Vote: I like it +7 Vote: I do not like it

Mind