Mod-01 Lec-37 Dynamic Programming Problem
About this video
Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidenceCovers dynamic programming problem formulation and solution approach. Hour-long lecture on optimal substructure and recursion.
A 63-minute video from nptelhrd: “Mod-01 Lec-37 Dynamic Programming Problem”.
Video by nptelhrd, played through YouTube's embedded player.
Part of Mathematics - Optimization