Dynamic Programming on Trees - Coding Interviews: Algorithm and Data Structure Proficiency

This book "Dynamic Programming on Trees" is a deep dive into applying Dynamic Programming technique on Tree Data Structure based problems. On completing this book, you will have these core skills:

• Strong hold on Dynamic Programming on Trees
• Easily solve Dynamic Programming problems in Coding Interview

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

1. Introduction to Tree
2. Introduction to Dynamic Programming
3. Dynamic Programming on Tree
4. Practice Problems:
5. Find height of every node of Binary Tree
6. Find diameter of Binary Tree using height of every node
7. Find diameter of N-ary Binary Tree
8. Largest Independent Set in Binary Tree
9. Binary Lifting with kth ancestor
10. Minimum number of nodes to be deleted so that at most k leaves are left
11. Minimum Cost Path in 2D matrix
12. Maximum Cost Path in 2D matrix
13. Maximum average value path in a 2D matrix (Restricted)
14. Minimum average value path in a 2D matrix (Restricted)
15. Count paths from Top Left to Bottom Right of a Matrix
16. Minimum Cost for Triangulation of a Convex Polygon
17. Number of paths with k edges
18. Shortest Path with k edges
19. Vertex Cover Problem