Dynamic Programming on Trees (Coding Interviews: Algorithm and Data Structure Proficiency Book 10)
Aditya Chatterjee & Ue Kiao- Strong hold on Dynamic Programming on Trees
- Easily solve Dynamic Programming problems in Coding Interview
Best approach to go through this book
- Master the basics (Part 1): This part introduces you to the basics of Tree Data Structure, Dynamic Programming (DP) and how DP can be applied on Tree. Having a strong hold in this part helps you to visualize solutions.
- Practice Problems on Tree DP (Part 2): Practice is a key to success for Coding Interviews, Competitive Programming and Efficient Problem Solving. Practice one problem everyday by implementing the solution on your own.
- Practice Problems on Graph DP (Part 3): Tree is a restricted version of a Graph and problems in this section will take you to the next level. You will view Trees and Graphs differently.