🎯 NeetCode 150 Master Track
Complete C# (.NET 8/9) implementation roadmap for the NeetCode 150 curriculum organized into 18 core DSA patterns.
📌 Pattern Categories & Solution Breakdown
📂 Arrays and Hashing (9 Problems)
- 01.Duplicate-Integer
- 02.Valid-Anagram
- 03.Two-Sum
- 04.Group-Anagrams
- 05.Top-K-Frequent-Elements
- 06.Encode-and-Decode-Strings
- 07.Product-of-Array-Except-Self
- 08.Valid-Sudoku
- 09.Longest-Consecutive-Sequence
📂 Two Pointers (5 Problems)
- 10.Valid-Palindrome
- 11.Two-Sum-II-Input-Array-Is-Sorted
- 12.3Sum
- 13.Container-With-Most-Water
- 14.Trapping-Rain-Water
📂 Sliding Window (6 Problems)
- 15.Best-Time-to-Buy-and-Sell-Stock
- 16.Longest-Substring-Without-Repeating-Characters
- 17.Longest-Repeating-Character-Replacement
- 18.Permutation-in-String
- 19.Minimum-Window-Substring
- 20.Sliding-Window-Maximum
📂 Stack (7 Problems)
- 21.Valid-Parentheses
- 22.Min-Stack
- 23.Evaluate-Reverse-Polish-Notation
- 24.Generate-Parentheses
- 25.Daily-Temperatures
- 26.Car-Fleet
- 27.Largest-Rectangle-in-Histogram
📂 Binary Search (7 Problems)
- 28.Binary-Search
- 29.Search-a-2D-Matrix
- 30.Koko-Eating-Bananas
- 31.Find-Minimum-in-Rotated-Sorted-Array
- 32.Search-in-Rotated-Sorted-Array
- 33.Time-Based-Key-Value-Store
- 34.Median-of-Two-Sorted-Arrays
📂 Linked List (11 Problems)
- 35.Reverse-Linked-List
- 36.Merge-Two-Sorted-Lists
- 37.Reorder-List
- 38.Remove-Nth-Node-From-End-of-List
- 39.Copy-List-with-Random-Pointer
- 40.Add-Two-Numbers
- 41.Linked-List-Cycle
- 42.Find-the-Duplicate-Number
- 43.LRU-Cache
- 44.Merge-k-Sorted-Lists
- 45.Reverse-Nodes-in-k-Group
📂 Trees (15 Problems)
- 46.Invert-Binary-Tree
- 47.Maximum-Depth-of-Binary-Tree
- 48.Diameter-of-Binary-Tree
- 49.Balanced-Binary-Tree
- 50.Same-Tree
- 51.Subtree-of-Another-Tree
- 52.Lowest-Common-Ancestor-of-a-Binary-Search-Tree
- 53.Binary-Tree-Level-Order-Traversal
- 54.Binary-Tree-Right-Side-View
- 55.Count-Good-Nodes-in-Binary-Tree
- 56.Validate-Binary-Search-Tree
- 57.Kth-Smallest-Element-in-a-BST
- 58.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal
- 59.Binary-Tree-Maximum-Path-Sum
- 60.Serialize-and-Deserialize-Binary-Tree
📂 Tries (3 Problems)
📂 Heap Priority Queue (7 Problems)
- 64.Kth-Largest-Element-in-a-Stream
- 65.Last-Stone-Weight
- 66.K-Closest-Points-to-Origin
- 67.Kth-Largest-Element-in-an-Array
- 68.Task-Scheduler
- 69.Design-Twitter
- 70.Find-Median-from-Data-Stream
📂 Backtracking (9 Problems)
- 71.Subsets
- 72.Combination-Sum
- 73.Permutations
- 74.Subsets-II
- 75.Combination-Sum-II
- 76.Word-Search
- 77.Palindrome-Partitioning
- 78.Letter-Combinations-of-a-Phone-Number
- 79.N-Queens
📂 Graphs (13 Problems)
- 80.Number-of-Islands
- 81.Max-Area-of-Island
- 82.Clone-Graph
- 83.Walls-and-Gates
- 84.Rotting-Oranges
- 85.Pacific-Atlantic-Water-Flow
- 86.Surrounded-Regions
- 87.Course-Schedule
- 88.Course-Schedule-II
- 89.Graph-Valid-Tree
- 90.Number-of-Connected-Components-in-an-Undirected-Graph
- 91.Redundant-Connection
- 92.Word-Ladder
📂 Advanced Graphs (6 Problems)
- 93.Reconstruct-Itinerary
- 94.Min-Cost-to-Connect-All-Points
- 95.Network-Delay-Time
- 96.Swim-in-Rising-Water
- 97.Alien-Dictionary
- 98.Cheapest-Flights-Within-K-Stops
📂 1D Dynamic Programming (12 Problems)
- 100.Min-Cost-Climbing-Stairs
- 101.House-Robber
- 102.House-Robber-II
- 103.Longest-Palindromic-Substring
- 104.Palindromic-Substrings
- 105.Decode-Ways
- 106.Coin-Change
- 107.Maximum-Product-Subarray
- 108.Word-Break
- 109.Longest-Increasing-Subsequence
- 110.Partition-Equal-Subset-Sum
- 99.Climbing-Stairs
📂 2D Dynamic Programming (11 Problems)
- 111.Unique-Paths
- 112.Longest-Common-Subsequence
- 113.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown
- 114.Coin-Change-II
- 115.Target-Sum
- 116.Interleaving-String
- 117.Longest-Increasing-Path-in-a-Matrix
- 118.Distinct-Subsequences
- 119.Edit-Distance
- 120.Burst-Balloons
- 121.Regular-Expression-Matching
📂 Greedy (8 Problems)
- 122.Maximum-Subarray
- 123.Jump-Game
- 124.Jump-Game-II
- 125.Gas-Station
- 126.Hand-of-Straights
- 127.Merge-Triplets-to-Form-Target-Triplet
- 128.Partition-Labels
- 129.Valid-Parenthesis-String
📂 Intervals (6 Problems)
- 130.Insert-Interval
- 131.Merge-Intervals
- 132.Non-overlapping-Intervals
- 133.Meeting-Rooms
- 134.Meeting-Rooms-II
- 135.Minimum-Interval-to-Include-Each-Query
📂 Math and Geometry (8 Problems)
- 136.Rotate-Image
- 137.Spiral-Matrix
- 138.Set-Matrix-Zeroes
- 139.Happy-Number
- 140.Plus-One
- 141.Pow(x,-n)
- 142.Multiply-Strings
- 143.Detect-Squares