Скачать или смотреть DYNAMIC PROGRAMMING Made Easy: Understanding Recursion Through Live Coding 🧠

Just a chill session working through some DYNAMIC PROGRAMMING problems. If you're studying for interviews or just want to hang out and talk tech, pull up a chair.



The video is a live coding session focused on solving dynamic programming (DP) problems. The presenter, Anuj, starts by tackling the "Climbing Stairs" problem (1:56), explaining how to find the number of distinct ways to climb a staircase by taking one or two steps at a time. He initially uses an array to store counts (6:10) but later tries to optimize space by using only three variables (11:02) to solve the problem, encountering some debugging challenges (19:17).

He then moves on to a more complex problem (40:08) involving rolling dice multiple times to achieve a specific sum (41:47). He relates this to an extension of the staircase problem (44:53), where instead of two choices (one or two steps), there are six choices (dice outcomes 1-6). The presenter discusses how to approach this problem by summing previous values (50:18) and considers the complications of handling modulo for large sums (52:53) and optimizing space (55:35) using a circular array (1:10:51), which also presents debugging difficulties (1:18:03). The session concludes with the presenter acknowledging the challenges and deciding to move on to other problems (1:32:28).