Guest
Problem Solving\ 10:27 Solution - Largest Island 22:57 Solution - Graph Sequence Programming (1D)\ 29:02 Introduction to Dynamic Programming 45:51 A Note about DP 50:56 N-K Ladders (3 Approaches) 1:03:44 N-K Ladders Code (Top Down) 1:07:55 N-K Ladders Code (Bottom Up) 1:16:02 Coin Change 1:27:46 Coin Change Code 1:34:37 Cutting Rods Solved! 1:51:02 Min Array Jumps 1:58:30 Min Array Jumps Code 2:04:24 Frog’s Min Cost-I 2:12:25 Frog’s Min Cost-I Code 2:15:18 Maximum Non Adjacent Sum 2:21:53 Maximum Non Adjacent Sum Code 2:26:37 Longest Increasing Sequence 2:33:23 Longest Increasing Subsequence Code 2:36:08 Box Stacking Problem 2:46:34 Box Stacking Code 2:56:18 Counting Trees 3:04:42 Counting Trees Code 3:07:53 Counting Trees Bottom Up Code Programming (2D)\ 3:12:06 Longest Common Subsequence 3:20:06 LCS Top Down 3:31:13 LCS Bottom Up & Print 3:50:44 Selling Wines 3:57:17 Selling Wines - Top Down DP Code 4:03:39 Selling Wines - Diagonal Table Filling 4:12:51 Selling Wines - Bottom Up DP Code 4:20:49 Counting Subsequences 4:30:10 Counting Subsequences Recursive 4:35:29 Counting Subsequences - Table Filling 4:43:07 Counting Subsequences - Bottom Up 4:47:46 Knapsack Problem 4:58:58 Knapsack Problem Recursive 5:02:37 Knapsack Problem Bottom Up Project - LRU Cache\ 5:11:23 LRU Cache Introduction 5:19:03 LRU Data Structure 5:27:21 LRU Code-I 5:31:56 LRU Code - II 5:36:26 LRU Code - III 5:40:24 LRU Code - IV
