DP on Trees | Coin DP in Tree | Problem E of Codeforces Edu Round 162 (Div 2)

Hello everyone, I'm Saptarshi Mukherjee, a Software Engineer III at Google and a Competitive Programmer with some titles like 3 times ACM-ICPC Regionals, Former Master at Codeforces, and 6 star at Codechef, Former Educator and Mentor at Unacademy, etc. 00:00:00 Introduction 00:01:35 Important points on DP (Related Problem:    • Codeforces Round 922 Problem D - Blocking ...  ) 00:04:51 Coin DP Tree Problem 00:10:27 The linear 1D version 00:14:38 DP Formulation for the linear 1D version 00:20:07 Extending the approach to the Tree problem 00:28:08 Undirected (unrooted) Tree to directed (rooted) tree 00:30:00 Coding implementation 00:37:13 CF Problem "Count Paths" 00:43:15 Intuition Building for DP approach 00:52:14 DP Formulations 00:56:14 Merge Small to Large 01:01:21 My coding implementation 01:09:34 How the case of more than 2 children are handled 01:12:18 Other Problem on this topic 01:13:41 Closure Please like, subscribe, and share with folks who may find it informative! See you all in the next videos! Codeforces: https://codeforces.com/profile/saptar... Linkedin:   / saptarshi-mukherjee-52660616b