Time Complexity of Tree DP : The Omnipotent Monster Killer Codeforces Round 958 Editorial

DP on Trees
Dynamic Programming
Time Complexity
Codeforces Editorial for Problem D: The Omnipotent Monster Killer from CF round 985
ID 1988D

[@cfstepofficial]

Code, Slides, practice problems cfstep.com/codeforces/contests/contest-1988/problem-d/
Sorry for the long video. It was unintentional.

[@overrancid]

Don't be sorry. There was something informative in every minute of the video ❤

[@gauravd3301]

These are very helpful Sir, please keep up the excellent work

[@sanchitkumar6626]

Great video really out of compition a very less youtube channel starts from brute force solution and your are one of them.

[@mohamedsheshtawy6235]

thank you so much for your efforts don't stop please

[@m7_3laa]

I appreciate your efforts, I believe you are gonna be great person.

[@andrejvarga8781]

I really like ur proofs, keep up the great work!😃

[@sdmfslkdm]

keep doing this for good ds and Es of codeforces , we could be a member as well for such amazing content .

[@moody300]

It was fabulous tutorial for a beginner to understand complex problem this way, splitting up into its components, getting into the core of each step, like what's exactly happening to optimising every steps with accurate examples. It is gold for me 🙏.

[@sxzz5]

At 20:00 "The more proficient you become at DP, the more afraid you become of trying greedy". So so so on point 😂😂

[@yunogasai_uwu4648]

Great work❤

[@mmmnmmmmmmmm]

Thank you for the video!! Was waiting for your upload!!

[@jaishriharivishnu]

You deserve much better...such a nice and comprehensive and clear Proof

[@sdmfslkdm]

crAZY guy

[@og_prakash]

great video !!!

[@ManshiSharma-ru9yw]

Can we solve Problem D via colouring (Bipartite graphs) ?

[@cfstepofficial]

No, I talk about why it is incorrect at 20:20 in the video

[@jaishriharivishnu]

32:30... sir, how did you understood this much using editorial? the editorial is not written properly.

[@caiodavi9829]

strong