An introduction on how to solve tiling problems using dynamic programming
Next video:
[ Ссылка ]
Project Euler practice problems:
[ Ссылка ]
[ Ссылка ]
[ Ссылка ]
[ Ссылка ]
Algorithms code repository:
[ Ссылка ]
Video slides:
[ Ссылка ]
Website:
[ Ссылка ]
Audio intro/outro composed by Richard Saney (rnsaney@gmail.com)
0:00 Intro
1:23 Top-down approach
3:47 Recursion tree
7:06 Recursive approach code
7:40 Repeating subtrees
8:39 Recursion tree with caching
11:07 Recursive implementation with caching
12:37 Bottom-up approach
15:08 Bottom-up (iterative) implementation
15:50 Related tiling problems
