dynamic programming on trees | maximum white subtree

Hello :D Please scroll down. First time in this channel we see a little bit of dynamic programming, I hope you guys enjoy this video Remember to share it with those who need it and subscribe for more wonderful content Some clarifications: -This channel is oriented to competitive programming, however, if this is not your area and you can learn something, then welcome. -This video belongs to the beginner section. -I assume you already know c++ language, that is why I do not stop in technical explanations, but the idea itself. -I am using c++ as it is the most accepted language in informatics competitions and is the one I can use the most. -In many of the programming practice websites, library "bits/stdc++.h" is enough and that is why you will see it in every video. -Information is taken from competitive programming books like "Introduction to Algorithms" written by T.Cormen, Halim & Halim "Competitive Programming 3" and Antti Laaksonen "Guide to Competitive Programming" Links to the resources used in this video: https://github.com/darele/progra123 (link to the repository with codes for the problems examined in this channel) https://codeforces.com/contest/1324/problem/F (link to the problem) https://github.com/darele/progra123/blob/master/Codeforces/Maximum%20white%20subtree%201324F.cpp (link to the code) https://www.geeksforgeeks.org/dynamic-programming-trees-set-2/ (an article about dp on trees similar to what we did on this video) #codeforces #dp #trees