In this Algorithm Friyay I demonstrate how to use recursion to free up disk space for your hard drive and how similar it is to working with ASTs.
I give a lecture to the Insiten crew introducing them to dynamic programming. The time-traveling debugger was employed here to demonstrate the performance characteristics of inefficient recursive algorithms.
I continuation of my first lecture on dynamic programming: https://tobyho.com/video/Intro-to-Dynamic-Programming.html. In this one we explore the longest common subsequence problem, a classic example in dynamic programming.