NeetCode 150
Concept-ordered view with NeetCode sequence retained inside each concept.
Solved: 0 / 150 Coverage: 114/150
1. Arrays & Hashing
2. Two Pointers
3. Sliding Window
4. Stack
5. Binary Search
6. Linked List
NC#35 easy 206. Reverse Linked List NC#36 easy 21. Merge Two Sorted Lists NC#37 medium 143. Reorder List NC#38 medium 19. Remove Nth Node From End of List NC#39 medium 138. Copy List with Random Pointer NC#40 medium 2. Add Two Numbers NC#41 easy 141. Linked List Cycle NC#44 hard 23. Merge k Sorted Lists NC#45 hard 25. Reverse Nodes in k-Group
7. Trees
NC#46 easy 226. Invert Binary Tree NC#47 easy 104. Maximum Depth of Binary Tree NC#48 medium 543. Diameter of Binary Tree NC#49 medium 110. Balanced Binary Tree NC#50 easy 100. Same Tree NC#51 easy 572. Subtree of Another Tree NC#52 easy 235. Lowest Common Ancestor of a Binary Search Tree NC#54 medium 199. Binary Tree Right Side View NC#56 medium 98. Validate Binary Search Tree NC#57 medium 230. Kth Smallest Element in a BST NC#58 medium 105. Construct Binary Tree from Preorder and Inorder Traversal NC#59 hard 124. Binary Tree Maximum Path Sum
8. Intervals
9. Bit Manipulation
10. Backtracking
11. Dynamic Programming
NC#99 easy 70. Climbing Stairs NC#100 medium 746. Min Cost Climbing Stairs NC#101 medium 198. House Robber NC#102 medium 213. House Robber II NC#103 medium 5. Longest Palindromic Substring NC#104 medium 647. Palindromic Substrings NC#105 medium 91. Decode Ways NC#106 medium 322. Coin Change NC#107 medium 152. Maximum Product Subarray NC#108 medium 139. Word Break NC#109 medium 300. Longest Increasing Subsequence NC#111 medium 62. Unique Paths NC#112 medium 1143. Longest Common Subsequence NC#113 medium 309. Best Time to Buy and Sell Stock with Cooldown NC#114 medium 518. Coin Change II NC#116 medium 97. Interleaving String NC#119 medium 72. Edit Distance NC#121 hard 10. Regular Expression Matching NC#122 medium 53. Maximum Subarray NC#146 easy 338. Counting Bits
12. Greedy
13. Stack / Backtracking
14. Greedy / BFS
15. Math & Geometry
16. Math & Geometry - Simulation
17. Backtracking / DFS
18. Stack - Monotonic Stack
19. Trees / BFS
20. Graphs - BFS
21. Backtracking / DP
22. Graphs / DFS
23. Graphs / Topological Sort
24. Tries - Prefix Tree
25. Trie / Data Structure Design
26. Backtracking / Trie
27. Heap / Priority Queue
28. Graphs / Trees
29. NeetCode 150
NC#8 todo Encode and Decode Strings
NC#20 todo Sliding Window Maximum
NC#26 todo Car Fleet
NC#33 todo Time Based Key-Value Store
NC#43 todo LRU Cache
NC#55 todo Count Good Nodes in Binary Tree
NC#69 todo Design Twitter
NC#70 todo Find Median from Data Stream
NC#78 todo Letter Combinations of a Phone Number
NC#84 todo Surrounded Regions
NC#86 todo Walls and Gates
NC#88 todo Course Schedule II
NC#89 todo Redundant Connection
NC#90 todo Number of Connected Components in an Undirected Graph
NC#93 todo Reconstruct Itinerary
NC#94 todo Min Cost to Connect All Points
NC#95 todo Network Delay Time
NC#96 todo Swim in Rising Water
NC#97 todo Alien Dictionary
NC#98 todo Cheapest Flights Within K Stops
NC#110 todo Partition Equal Subset Sum
NC#115 todo Target Sum
NC#117 todo Longest Increasing Path in a Matrix
NC#118 todo Distinct Subsequences
NC#120 todo Burst Balloons
NC#125 todo Gas Station
NC#126 todo Hand of Straights
NC#127 todo Merge Triplets to Form Target Triplet
NC#128 todo Partition Labels
NC#129 todo Valid Parenthesis String
NC#135 todo Minimum Interval to Include Each Query
NC#139 todo Happy Number
NC#142 todo Multiply Strings
NC#143 todo Detect Squares
NC#144 todo Single Number
NC#150 todo Reverse Integer