•PRACTICE
DP Interview Questions
10 DP problems asked across FAANG and top tech companies. Approach hints, optimal solutions, and related problems.
Filter by company
Clear all ✕Filter by topic
Array (178)Backtracking (17)BFS (23)Binary Search (34)Binary Tree (13)Bit Manipulation (16)Breadth-First Search (20)Counting (7)Data Stream (6)Database (6)Depth-First Search (27)Design (37)DFS (24)Divide and Conquer (7)Doubly-Linked List (5)DP (10)Dynamic Programming (39)Graph (6)Graph Theory (13)Greedy (31)Hash Table (87)Heap (12)Heap (Priority Queue) (13)Linked List (15)Math (32)Matrix (22)Monotonic Stack (6)Ordered Set (8)Prefix Sum (11)Queue (10)Recursion (7)Simulation (11)Sliding Window (21)Sorting (45)Stack (24)String (85)Topological Sort (6)Tree (30)Trie (10)Two Pointers (30)Union-Find (13)
🔒
to save your progress.
| ✓ 0 | Problem | Difficulty | Companies | Breakdown / Solution | LeetCode |
|---|---|---|---|---|---|
| Best Time to Buy and Sell Stock II | Medium | 3 companies | View breakdown → | ||
| Wildcard Matching | Hard | 2 companies | View breakdown → | ||
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 3 companies | View breakdown → | ||
| Minimum Operations to Reduce an Integer to 0 | Medium | 3 companies | View breakdown → | ||
| Split Array Largest Sum | Hard | 3 companies | View breakdown → | ||
| Binary Tree Maximum Path Sum | Hard | 3 companies | View breakdown → | ||
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 1 companies | View breakdown → | ||
| Longest Palindromic Subsequence | Medium | 1 companies | View breakdown → | ||
| Longest Increasing Subsequence | Medium | 1 companies | View breakdown → | ||
| Last Stone Weight II | Medium | 1 companies | View breakdown → |
Practice with a Mock Interview
Solve these DP problems under real interview pressure with our AI interviewer.
Start Mock Interview →