Dynamic Programming on Trees - Algorithms for Coding Interviews

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 TreesEasily solve Dynamic Programming problems in Coding InterviewBest 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.
Table of contents: Introduction to TreeIntroduction to Dynamic ProgrammingDynamic Programming on TreePractice Problems: Find height of every node of Binary TreeFind diameter of Binary Tree using height of every nodeFind diameter of N-ary Binary TreeLargest Independent Set in Binary TreeBinary Lifting with kth ancestorMinimum number of nodes to be deleted so that at most k leaves are leftMinimum Cost Path in 2D matrixMaximum Cost Path in 2D matrixMaximum average value path in a 2D matrix (Restricted) Minimum average value path in a 2D matrix (Restricted) Count paths from Top Left to Bottom Right of a MatrixMinimum Cost for Triangulation of a Convex PolygonNumber of paths with k edgesShortest Path with k edgesVertex Cover Problem
Get started with this book and change the equation of your career.

Book: Dynamic Programming on Trees
Authors (2): Aditya Chatterjee, Ue Kiao
Published: January 2022 (Edition 1)
Publisher: OpenGenus