Loading repovive.com/roadmaps/pattern-22
Roadmaps
Pattern 22: LeetCode Interview Patterns
Dynamic Programming - 2D
Problemset
Discussion
AI Helper
Getting Started
0/5
Hash Map Patterns
0/33
Two Pointers
0/31
Sliding Window
0/33
Prefix Sum
0/32
Binary Search
0/33
Linked List
0/29
Stack Patterns
0/31
Monotonic Stack
0/32
Heap / Priority Queue
0/32
Trees
0/31
Trie
0/32
Backtracking
0/34
Graphs - BFS
0/32
Graphs - DFS
0/36
Topological Sort
0/32
Union Find
0/40
Dynamic Programming - 1D
0/36
Dynamic Programming - 2D
0/32
1
What is Dynamic Programming - 2D
2
Prerequisites
3
When to Use
4
When NOT to Use
5
LeetCode 62 Unique Paths - Problem Statement
6
Quiz: Grid Paths Recurrence
7
LeetCode 62 Unique Paths - Solution
8
LeetCode 62 Unique Paths - Example and Complexity Analysis
9
LeetCode 62 Unique Paths - Implementation
10
LeetCode 97 Interleaving String - Problem Statement
11
LeetCode 97 Interleaving String - Why Naive Fails
12
LeetCode 97 Interleaving String - Solution
13
LeetCode 97 Interleaving String - Example and Complexity Analysis
14
LeetCode 97 Interleaving String - Implementation
15
LeetCode 1143 Longest Common Subsequence - Problem Statement
16
Quiz: LCS Recurrence
17
LeetCode 1143 Longest Common Subsequence - Why Naive Fails
18
LeetCode 1143 Longest Common Subsequence - Solution
19
LeetCode 1143 Longest Common Subsequence - Example and Complexity Analysis
20
LeetCode 1143 Longest Common Subsequence - Implementation
21
LeetCode 72 Edit Distance - Problem Statement
22
LeetCode 72 Edit Distance - Why Naive Fails
23
LeetCode 72 Edit Distance - Solution
24
LeetCode 72 Edit Distance - Example and Complexity Analysis
25
LeetCode 72 Edit Distance - Implementation
26
LeetCode 115 Distinct Subsequences - Problem Statement
27
LeetCode 115 Distinct Subsequences - Why Naive Fails
28
LeetCode 115 Distinct Subsequences - Solution
29
LeetCode 115 Distinct Subsequences - Example and Complexity Analysis
30
LeetCode 115 Distinct Subsequences - Implementation
31
Common Mistakes
32
Section Recap
Intervals
0/31
Greedy
0/40
Bit Manipulation
0/34
Segment Tree
0/27
30-Day LeetCode Study Plan
0/8
19.1
What is Dynamic Programming - 2D
2 minutes
100%
Tasks
Read Unit