Topics

• Dynamic Programming
• Rod Cutting
• Edit Distance Dynamic Algorithm
• Binary Heap
• Knuth Morris Pratt (KMP) Algorithm

Examples

• Edit Distance
• Longest Common Subsequence
• Fibonacci Number
• Longest Common Substring
• Cutting the Rod to get the maximum profit
• Minimum Edits required to convert string 1 to string 2
• Example
• KMP-Example