Hello Codeforces, I recently started my YouTube Channel and started to create a Complete Dynamic Programming Course from beginner to advanced. And today I made a video on Flipping Game Problem which I find very interesting. In the video I explained how to reach from O(n^3) to O(n) time complexity.<br><br>↵
[Link to video](https://youtu.be/zF0UgUXGnuU)<br><br>↵
Please watch at 1.25x speed for better experience.<br>↵
I hope you like the video.
[Link to video](https://youtu.be/zF0UgUXGnuU)<br><br>↵
Please watch at 1.25x speed for better experience.<br>↵
I hope you like the video.
