Ultimate DSA Interview Prep: 12/12 Dynamic Programming

A curated list of LeetCode problems covering key concepts and techniques to help you prepare for your next DSA interview.

1. Arrays & Strings
2. Hashmaps & Sets
3. 2 Pointers
4. Stacks
5. Linked List
6. Binary Search
7. Sliding Window
8. Trees
9. Heaps
10. Recursive Backtracking
11. Graphs
12. Dynamic Programming

Graphs

Easy:

1. https://leetcode.com/problems/fibonacci-number/description/
2. https://leetcode.com/problems/climbing-stairs/description/
3. https://leetcode.com/problems/min-cost-climbing-stairs/description/

Medium:

4. https://leetcode.com/problems/house-robber/description/

5. https://leetcode.com/problems/unique-paths/description/

6. https://leetcode.com/problems/maximum-subarray/description/

7. https://leetcode.com/problems/longest-increasing-subsequence/description/