Completed
Lecture 137: EDIT Distance || DP on Strings
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Dynamic Programming Complete Course - Introduction to Advanced DP Concepts
Automatically move to the next video in the Classroom when playback concludes
- 1 Lecture 102: Introduction to Dynamic Programming | Memoization | Tabulation | Space Optimisation
- 2 Lecture 103: Minimum Cost Climbing Stairs || DP Series
- 3 Lecture 104: Minimum Number of Coins || DP Series
- 4 Lecture 105: Maximum Sum of Non-Adjacent Elements || DP Series
- 5 Lecture 106: House Robbery Problem || DP Series
- 6 Lecture 107: Cut Rod into Segments of X, Y, Z || DP Series
- 7 Lecture 108: Count derangements || DP Series
- 8 Lecture 109: Painting Fence Algorithm || DP Series
- 9 Lecture 110: 0/1 KnapSack Problem || learn 2-D DP Concept || DP Series
- 10 Lecture 111: Combination Sum IV Problem || DP Series
- 11 Lecture 112: Perfect Squares Problem || DP Series
- 12 Lecture 114: Minimum Cost for Tickets || Part-2 || DP Series
- 13 Lecture 113: Minimum Cost for Tickets || Part-1 || DP Series
- 14 Lecture 115: Largest Square area in Matrix || DP Series
- 15 Lecture 116: Min Score Triangulation of Polygon || DP Series
- 16 Lecture 117: Minimum Sideways Jump LeetCode || 2D-DP || DP Series
- 17 Lecture 118: Reducing Dishes LeetCode || 2D-DP || DP Series
- 18 Lecture 119: Longest Increasing Subsequence + Russian Doll LeetCode || DP + Binary Search
- 19 Lecture 120: Maximum Height by Stacking Cuboid || DP Series
- 20 Lecture 121: Pizza with 3n Slices || 2D - DP || DP Series
- 21 Lecture 122: Number of Dice Rolls with Target Sum || DP Series
- 22 Lecture 123: Partition Equal Subset Sum || DP Series
- 23 Lecture 124: Minimum Swaps to make Subsequences Increasing || DP Series
- 24 Lecture 125: Longest Arithmetic Subsequence || DP Series
- 25 Lecture 126: Longest AP with given Difference "d" || DP Series
- 26 Lecture 127: Unique Binary Search Trees || Catalan Number
- 27 Lecture 128: Guess Number Higher or Lower || DP Series
- 28 Lecture 129: Minimum Cost Tree From Leaf Values || DP Series
- 29 Lecture 130: Buy and Sell Stock [Part 1] || DP Series
- 30 Lecture 131: Buy and Sell Stock [Part 2] || DP Series
- 31 Lecture 132: Buy and Sell Stock [Part 3] || DP Series
- 32 Lecture 133: Buy and Sell Stock [Part 4] || DP Series
- 33 Lecture 134: Buy and Sell Stock [Part 5] || DP Series
- 34 Lecture 135: Longest Common Subsequence || DP on Strings
- 35 Lecture 136: Longest Palindromic Subsequence || DP on Strings
- 36 Lecture 137: EDIT Distance || DP on Strings
- 37 Lecture 138: Maximum Rectangle with all 1's || DP Series
- 38 Lecture 139: Wildcard Pattern Matching || DP Series
