Prioritized List of Topics
- 15. Dynamic Programming
- 2. Two Pointers
- 11. Depth First Search
- 12. Breadth First Search
- 14. Backtracking
- 10. Binary Tree Traversals
- 3. Sliding Window
- 5. Linked List In-Place Reversal
- 9. Modified Binary Search
- 7. Top K Elements
- 13. Matrix Traversal
- 4. Fast and Slow Pointers
- 8. Overlapping Intervals
- 6. Monotonic Stack
- 1. Prefix Sum
1. Prefix Sum
2. Two Pointers
3. Sliding Window
- 543: Maximum Average Subarray I
- 3: Longest Substring Without Repeating Charactersneetcode
- 7: Reverse Integerneetcode
4. Fast and Slow Pointers
5. Linked List In-Place Reversal
6. Monotonic Stack
- 496: Next Greater Element I
- 739: Daily Temperaturesneetcode
- 84: Largest Rectangle in Histogramneetcode
7. Top K Elements
- 215: Kth Largest Element in an Arrayneetcode
- 327: Count of Range Sum
- 373: Find K Pairs with Smallest Sums
8. Overlapping Intervals
9. Modified Binary Search
- 33: Search in Rotated Sorted Arrayneetcode
- 153: Find Minimum in Rotated Sorted Arrayneetcode
- 240: Search a 2D Matrix II
10. Binary Tree Traversals
- 230: Kth Smallest Element in a BSTneetcode
- 257: Binary Tree Paths
- 124: Binary Tree Maximum Path Sumneetcode
- 107: Binary Tree Level Order Traversal II
11. Depth First Search
12. Breadth First Search
- 102: Binary Tree Level Order Traversalneetcode
- 994: Rotting Orangesneetcode
- 127: Word Ladderneetcode