Patterns Track
Concept difficulty progression from fundamentals to advanced topics.
Solved: 0 / 185
1. Arrays & Hashing
8 problems Two Pointers ArrayHash Map/Set
2. Two Pointers
6 problems Two Pointers ArrayHash Map/Set
3. Sliding Window
7 problems Sliding WindowTwo PointersBacktracking Hash Map/SetTreeArray
4. Stack
4 problems StackTrieArray
5. Binary Search
7 problems Two PointersBinary SearchRecursionBacktracking ArrayHash Map/SetStack
6. Linked List
9 problems Two PointersBinary SearchRecursion ArrayLinked ListHash Map/SetStack
7. Trees
12 problems Two PointersBinary SearchDFSBFSRecursion TreeQueue/DequeArrayHash Map/SetStack
#100 easy Same Tree #104 easy Maximum Depth of Binary Tree #226 easy Invert Binary Tree #235 easy Lowest Common Ancestor of a Binary Search Tree #572 easy Subtree of Another Tree #98 medium Validate Binary Search Tree #105 medium Construct Binary Tree from Preorder and Inorder Traversal #110 medium Balanced Binary Tree #199 medium Binary Tree Right Side View #230 medium Kth Smallest Element in a BST #543 medium Diameter of Binary Tree #124 hard Binary Tree Maximum Path Sum
8. Intervals
5 problems ArrayHash Map/Set
9. Bit Manipulation
6 problems RecursionTwo Pointers StackHash Map/SetArray
10. Backtracking
8 problems BacktrackingRecursion ArrayHash Map/SetStack
11. Dynamic Programming
32 problems Dynamic ProgrammingBinary SearchPrefix SumRecursionDFSGreedy TreeArrayHash Map/SetTrie
#70 easy Climbing Stairs #338 easy Counting Bits #5 medium Longest Palindromic Substring #53 medium Maximum Subarray #62 medium Unique Paths #63 medium Unique Paths II #64 medium Minimum Path Sum #72 medium Edit Distance #91 medium Decode Ways #97 medium Interleaving String #122 medium Best Time to Buy and Sell Stock II #139 medium Word Break #152 medium Maximum Product Subarray #198 medium House Robber #213 medium House Robber II #221 medium Maximal Square #279 medium Perfect Squares #300 medium Longest Increasing Subsequence #309 medium Best Time to Buy and Sell Stock with Cooldown #322 medium Coin Change #376 medium Wiggle Subsequence #377 medium Combination Sum IV #518 medium Coin Change II #583 medium Delete Operation for Two Strings #647 medium Palindromic Substrings #746 medium Min Cost Climbing Stairs #946 medium Distinct Substrings (LeetCode 1698) #983 medium Minimum Cost For Tickets #1143 medium Longest Common Subsequence #10 hard Regular Expression Matching #123 hard Best Time to Buy and Sell Stock III #132 hard Palindrome Partitioning II
12. Greedy
4 problems Greedy ArrayHash Map/Set
13. Stack / Backtracking
1 problems BacktrackingRecursion Stack
14. Arrays & Hashing (with constraints)
1 problems ArrayHash Map/Set
15. Greedy / BFS
1 problems BFSGreedy Array
16. Math & Geometry
6 problems ArrayHash Map/Set
17. Math & Geometry - Simulation
1 problems Recursion ArrayHash Map/Set
18. Backtracking / DFS
1 problems DFSBacktracking
19. Stack - Monotonic Stack
1 problems Monotonic Stack ArrayStack
20. Trees / BFS
2 problems BFS Queue/DequeTree
21. Graphs - BFS
1 problems BFS Hash Map/SetQueue/DequeGraph
22. Backtracking / DP
1 problems Dynamic ProgrammingBacktracking Tree
23. Graphs / DFS
4 problems DFSRecursionBFSUnion Find Hash Map/SetGraphArray
24. Greedy / String
1 problems Greedy Hash Map/Set
25. Graphs / Topological Sort
1 problems DFSTopological Sort ArrayGraph
26. Tries - Prefix Tree
1 problems ArrayHash Map/SetTreeTrie
27. Trie / Data Structure Design
1 problems Hash Map/SetTrie
28. Backtracking / Trie
1 problems DFSBacktrackingRecursion Hash Map/SetTrieArray
29. Heap / Priority Queue
5 problems BFSHeapBacktracking ArrayQueue/DequeHeapHash Map/Set
30. Graphs / Trees
1 problems DFS ArrayHash Map/SetTreeGraph
31. NeetCode 150
36 problems #271 medium Encode and Decode Strings #295 medium Find Median from Data Stream #355 medium Design Twitter #981 medium Time Based Key-Value Store #100020 medium Sliding Window Maximum #100026 medium Car Fleet #100043 medium LRU Cache #100055 medium Count Good Nodes in Binary Tree #100078 medium Letter Combinations of a Phone Number #100084 medium Surrounded Regions #100086 medium Walls and Gates #100088 medium Course Schedule II #100089 medium Redundant Connection #100090 medium Number of Connected Components in an Undirected Graph #100093 medium Reconstruct Itinerary #100094 medium Min Cost to Connect All Points #100095 medium Network Delay Time #100096 medium Swim in Rising Water #100097 medium Alien Dictionary #100098 medium Cheapest Flights Within K Stops #100110 medium Partition Equal Subset Sum #100115 medium Target Sum #100117 medium Longest Increasing Path in a Matrix #100118 medium Distinct Subsequences #100120 medium Burst Balloons #100125 medium Gas Station #100126 medium Hand of Straights #100127 medium Merge Triplets to Form Target Triplet #100128 medium Partition Labels #100129 medium Valid Parenthesis String #100135 medium Minimum Interval to Include Each Query #100139 medium Happy Number #100142 medium Multiply Strings #100143 medium Detect Squares #100144 medium Single Number #100150 medium Reverse Integer
32. Blind 75
4 problems33. Linked List / Floyd's Algorithm
1 problems ArrayLinked List
34. Trees / DFS
1 problems DFSRecursion Tree
35. Greedy / Sorting
1 problems BFSGreedy ArrayQueue/Deque
36. Intervals / Greedy
1 problems Greedy Array
37. Backtracking / Memoization
1 problems DFSBacktrackingRecursion Hash Map/Set
38. Graphs / BFS
1 problems BFS Queue/DequeGraph