Dynamic Programming - 2D

Problems using 2D dynamic programming

32 lessons
86 min

Lessons

1. What is Dynamic Programming - 2D

Pattern overview

2m

2. Prerequisites

What you need first

1m

3. When to Use

Pattern triggers

2m

4. When NOT to Use

Avoid forcing this pattern

2m

5. LeetCode 62 Unique Paths - Problem Statement

The problem

2m1 problems

6. Quiz: Grid Paths Recurrence

Test your understanding

2m1 problems

7. LeetCode 62 Unique Paths - Solution

The core idea

3m

8. LeetCode 62 Unique Paths - Example and Complexity Analysis

Walkthrough and analysis

3m

9. LeetCode 62 Unique Paths - Implementation

The approach

4m1 problems

10. LeetCode 97 Interleaving String - Problem Statement

The problem

3m1 problems

11. LeetCode 97 Interleaving String - Why Naive Fails

Why brute force fails

3m

12. LeetCode 97 Interleaving String - Solution

The pattern

4m

13. LeetCode 97 Interleaving String - Example and Complexity Analysis

Walkthrough and analysis

3m

14. LeetCode 97 Interleaving String - Implementation

The code

5m1 problems

15. LeetCode 1143 Longest Common Subsequence - Problem Statement

The problem

2m1 problems

16. Quiz: LCS Recurrence

Test your understanding

2m1 problems

17. LeetCode 1143 Longest Common Subsequence - Why Naive Fails

The trap

2m

18. LeetCode 1143 Longest Common Subsequence - Solution

The core idea

3m

19. LeetCode 1143 Longest Common Subsequence - Example and Complexity Analysis

Walkthrough and analysis

3m

20. LeetCode 1143 Longest Common Subsequence - Implementation

The approach

4m1 problems

21. LeetCode 72 Edit Distance - Problem Statement

The problem

2m1 problems

22. LeetCode 72 Edit Distance - Why Naive Fails

The trap

2m

23. LeetCode 72 Edit Distance - Solution

The core idea

3m

24. LeetCode 72 Edit Distance - Example and Complexity Analysis

Walkthrough and analysis

3m

25. LeetCode 72 Edit Distance - Implementation

The approach

4m1 problems

26. LeetCode 115 Distinct Subsequences - Problem Statement

The problem

2m1 problems

27. LeetCode 115 Distinct Subsequences - Why Naive Fails

The trap

2m

28. LeetCode 115 Distinct Subsequences - Solution

The core idea

3m

29. LeetCode 115 Distinct Subsequences - Example and Complexity Analysis

Walkthrough and analysis

3m

30. LeetCode 115 Distinct Subsequences - Implementation

The approach

4m1 problems

31. Common Mistakes

Common errors to avoid

2m

32. Section Recap

Summary

1m

Practice Problems

Ready to start learning?

Access all 32 lessons with interactive content and progress tracking.