Dallas Scott
Projects Writing Code Misc

CODE

The following are my solutions to the Neetcode 150 in C#.
Full solutions can also be found on my GitHub repository

#
Problem/Solution
Difficulty
Link
Arrays and Hashing
1
Contains Duplicate
Easy
2
Valid Anagram
Easy
3
Two Sum
Easy
4
Anagram Groups
Medium
5
Top K Frequent Elements
Medium
6
Encode and Decode Strings
Medium
7
Product of Array Except Self
Medium
8
Valid Sudoku
Medium
9
Longest Consecutive Sequence
Medium
Two Pointers
10
Valid Palindrome
Easy
11
Two Sum II Input Array Is Sorted
Medium
12
3Sum
Medium
13
Container With Most Water
Medium
14
Trapping Rain Water
Hard
Sliding Window
15
Best Time to Buy And Sell Stock
Easy
16
Longest Substring Without Repeating Characters
Medium
17
Longest Repeating Character Replacement
Medium
18
Permutation In String
Medium
19
Minimum Window Substring
Hard
20
Sliding Window Maximum
Hard
Stack
21
Valid Parentheses
Easy
22
Min Stack
Medium
23
Evaluate Reverse Polish Notation
Medium
24
Generate Parentheses
Medium
25
Daily Temperatures
Medium
26
Car Fleet
Medium
27
Largest Rectangle In Histogram
Hard
Binary Search
28
Binary Search
Easy
29
Search a 2D Matrix
Medium
30
Koko Eating Bananas
Medium
31
Find Minimum In Rotated Sorted Array
Medium
32
Search In Rotated Sorted Array
Medium
33
Time Based Key Value Store
Medium
34
Median of Two Sorted Arrays
Hard
Linked List
35
Reverse Linked List
Easy
36
Merge Two Sorted Lists
Easy
37
Linked List Cycle
Easy
38
Reorder List
Medium
39
Remove Nth Node From End of List
Medium
40
Copy List With Random Pointer
Medium
41
Add Two Numbers
Medium
42
Find The Duplicate Number
Medium
43
LRU Cache
Medium
44
Merge K Sorted Lists
Hard
45
Reverse Nodes In K Group
Hard
Trees
46
Invert Binary Tree
Easy
47
Maximum Depth of Binary Tree
Easy
48
Diameter of Binary Tree
Easy
49
Balanced Binary Tree
Easy
50
Same Tree
Easy
51
Subtree of Another Tree
Easy
52
Lowest Common Ancestor of a Binary Search Tree
Medium
53
Binary Tree Level Order Traversal
Medium
54
Binary Tree Right Side View
Medium
55
Count Good Nodes In Binary Tree
Medium
56
Validate Binary Search Tree
Medium
57
Kth Smallest Element In a BST
Medium
58
Construct Binary Tree From Preorder And Inorder Traversal
Medium
59
Binary Tree Maximum Path Sum
Hard
60
Serialize And Deserialize Binary Tree
Hard
Heap/Priority Queue
61
Kth Largest Element In a Stream
Easy
62
Last Stone Weight
Easy
63
K Closest Points to Origin
Medium
64
Kth Largest Element In An Array
Medium
65
Task Scheduler
Medium
66
Design Twitter
Medium
67
Find Median From Data Stream
Hard
Backtracking
68
Subsets
Medium
69
Combination Sum
Medium
70
Combination Sum II
Medium
71
Permutations
Medium
72
Subsets II
Medium
73
Word Search
Medium
74
Palindrome Partitioning
Medium
75
Letter Combinations of a Phone Number
Medium
76
N Queens
Hard
Tries
77
Implement Trie Prefix Tree
Medium
78
Design Add And Search Words Data Structure
Medium
79
Word Search II
Hard
© 2025 Dallas Scott