Dynamic Programming Video pt. 2

Hello everyone!

Me and DJeniUp are back with another programming video!

https://www.youtube.com/watch?v=dv_dGwrazuE

This video is about a tricky problem that i've encountered at my first ever programming competition. At first glance it seems like a simple strategy will cut it, but as you submit more and more solution, you start to realize it's not that simple...

This video is about interval dp, and you can solve the problem for yourself: https://mirror.codeforces.com/gym/106465/problem/A

PS: Thanks everybody for 1k subscribers!

Hello Everyone!

Me and DJeniUp recently started a YouTube channel dedicated to competitive programming.

Today, we released a new video! It's about Dynamic Programming:

Link: https://www.youtube.com/watch?v=eNjDWXugJCo

Feel free to leave your feedback and suggestions under the comments, we appreciate those!

Hello Everyone!

Recently, me and DJeniUp started a YouTube channel, dedicated to algorithms, math and competetive programming in general.

Today we released a new video on a topic of Topological Sort!

Link: https://www.youtube.com/watch?v=EJoKJiod0KQ

Feel free to leave your suggestions in the comments under the video or this blog! We would like to explore more competetive programming topics, from basic to complicated ones

Here's the link to the whiteboard that you see in the video: https://miro.com/app/board/uXjVGcpqFXU=/

All codes can be found there or on our github: https://github.com/Lincatoria/VideoMaterials

Centroid Decomposition is kinda like Divide & Conquer on arrays (merge sort type divide&connquer) but for trees. Ever thought about it that way? Like HLD is a segment tree but for trees, what do you think? nvm just had a fun thought yesterday, never looked at it from this angle, cool (i attached some imagery)