LeetCode Solutions

A collection of LeetCode solutions organized by Neetcode-style algorithm patterns for systematic interview preparation.

Progress

Category	Solved	Problems
01. Arrays & Hashing	1	128
02. Two Pointers	1	11
03. Sliding Window	1	643
04. Stack	3	155, 394, 2390
05. Binary Search	3	35, 74, 162
06. Linked List	0	-
07. Trees	2	94, 104
08. Tries	1	1268
09. Heap / Priority Queue	2	215, 347
10. Backtracking	3	17, 22, 39
11. Graphs	3	200, 529, 994
12. Dynamic Programming	3	5, 152, 322
13. Greedy	1	121
14. Intervals	0	-
15. Math & Geometry	0	-
16. Bit Manipulation	0	-

Total: 24 problems solved

Running Solutions

Each problem is a standalone Go program:

# Run a specific solution
go run ./12-dynamic-programming/322.coin-change/main.go

# Build all solutions
go build ./...

Suggested Problems to Add

High Priority (Common Interview Questions)

• Arrays & Hashing: 1. Two Sum, 49. Group Anagrams, 238. Product of Array Except Self
• Two Pointers: 15. 3Sum, 125. Valid Palindrome, 42. Trapping Rain Water
• Linked List: 206. Reverse Linked List, 21. Merge Two Sorted Lists, 141. Linked List Cycle
• Trees: 226. Invert Binary Tree, 102. Level Order Traversal, 98. Validate BST
• Graphs: 133. Clone Graph, 207. Course Schedule, 417. Pacific Atlantic Water Flow
• DP: 70. Climbing Stairs, 198. House Robber, 1143. Longest Common Subsequence

Medium Priority

• Intervals: 56. Merge Intervals, 57. Insert Interval
• Math & Geometry: 48. Rotate Image, 54. Spiral Matrix
• Bit Manipulation: 191. Number of 1 Bits, 338. Counting Bits

Reference Implementations

Algorithm reference implementations are in the _algorithms/ directory:

• Bubble Sort

Study Order

For systematic preparation, tackle categories in order:

1. Arrays & Hashing → Two Pointers → Sliding Window (foundation)
2. Stack → Binary Search (core techniques)
3. Linked List → Trees → Tries (data structures)
4. Heap → Backtracking → Graphs (advanced traversal)
5. Dynamic Programming → Greedy (optimization)
6. Intervals → Math → Bit Manipulation (specialized)