BACKTRACKING
Introduction to Backtracking, Rat in a Maze, Hint: Sudoku, No. of numbers without duplicates, Hint: No. of numbers - duplicates
INTRODUCTION TO DYNAMIC PROGRAMMING
Introduction to Memoization, Introduction to Dynamic Programming, Fibonacci numbers using recursion, memoization and dynamic programming
APPLICATIONS OF DYNAMIC PROGRAMMING
Min Steps To 1, Solution - Min Steps to 1, Solution : Min Steps to 1 (Memoization), Alpha Code, LIS, No. of Balanced BTs, Solution : No. of Balanced BTs, No. of Balanced BSTs, Max sum subarray, Min Cost Path, Solution : Min Cost Path (Brute Force), Min Cost Path - Memoization, Min Cost Path - DP, LCS, LCS - Memoization, LCS - DP, Edit Distance, Solution : Edit Distance (Brute Force), Solution : Edit Distance (Memoization), Solution : Edit Distance (DP), Matrix Chain Multiplication, Maximum sub squares with all 0s