NeetCode 150, Easy problems
Easy problems
All 28 easy problems in the NeetCode 150, grouped by pattern category. Each link points at the same problem page used in the category lists.
Arrays & Hashing
Two Pointers
Sliding Window
Stack
Binary Search
Linked List
Trees
- 100. Same Tree (Easy)
- 104. Maximum Depth of Binary Tree (Easy)
- 110. Balanced Binary Tree (Easy)
- 226. Invert Binary Tree (Easy)
- 543. Diameter of Binary Tree (Easy)
- 572. Subtree of Another Tree (Easy)
Heap / Priority Queue
Intervals
1-D Dynamic Programming
Math & Geometry
Bit Manipulation
- 136. Single Number (Easy)
- 190. Reverse Bits (Easy)
- 191. Number of 1 Bits (Easy)
- 268. Missing Number (Easy)
- 338. Counting Bits (Easy)
Related
- Medium problems (99 problems)
- Hard problems (22 problems)
- LeetCode 150 (NeetCode) (full topic)