Algorithms and data structures
Dynamic programming
Breaking a problem into overlapping subproblems and solving each once.
About 20 hours of study.
Where to learn it
Read
Competitive Programmer's Handbook
Antti Laaksonen
Chapter 7, Dynamic programming
Section not checked yet
Watch
Introduction to Algorithms (MIT 6.006, Spring 2020)
Erik Demaine, Jason Ku, Justin Solomon
Lectures 15–18
Practise
Wrong chapter, dead link, or know something better? Tell us on GitHub.
Which roles ask for it
- Software engineer (SDE) to get hired
- GATE computer science to get hired
- UGC NET computer science to get hired
Before and after
Learn first
Dynamic programming