Skip to main content
CodeTutor
Questions
Categories
Patterns
Progress
CodeTutor - Coding Interview Preparation
Questions
Difficulty
All
Easy
Medium
Hard
Search
Category
All Categories
Arrays (216)
Binary Search (22)
Dynamic Programming (73)
Graphs (37)
Hash Tables (78)
Heap (18)
Linked Lists (13)
Math (76)
Queue (10)
Recursion (51)
Sorting (40)
Stack (32)
Strings (89)
Trees (44)
Two Pointers (31)
Pattern
All Patterns
BFS (Breadth-First Search) (35)
Backtracking (28)
Binary Search (28)
Binary Tree Traversal (36)
Bit Manipulation (4)
Counting / Bucket Sort (2)
Cyclic Sort (0)
DFS (Depth-First Search) (53)
Divide and Conquer (0)
Dynamic Programming (69)
Fast & Slow Pointers (5)
Greedy (75)
Hashing (12)
Heap / Priority Queue (17)
LinkedList In-Place Reversal (6)
Matrix Manipulation (1)
Matrix Traversal (35)
Monotonic Stack (23)
Overlapping Intervals (4)
Prefix Sum (23)
Sliding Window (15)
Synchronization (1)
Topological Sort (1)
Trie (3)
Two Pointers (62)
Union Find (8)
Showing 20 of 51 questions
Combination Sum II
Medium
Arrays
Recursion
Backtracking
★
LeetCode #40
Combination Sum III
Medium
Arrays
Recursion
Backtracking
★
LeetCode #216
1
2
3
Combination Sum
Medium
Arrays
Recursion
Backtracking
★
LeetCode #39
Combinations
Medium
Arrays
Recursion
Backtracking
★
LeetCode #77
Construct Quad Tree
Medium
Arrays
Recursion
Trees
Matrix Traversal
★
DFS (Depth-First Search)
LeetCode #427
Convert Sorted Array to Binary Search Tree
Easy
Arrays
Recursion
Trees
Binary Search
★
DFS (Depth-First Search)
LeetCode #108
Decode String
Medium
Strings
Stack
Recursion
Monotonic Stack
★
LeetCode #394
Delete Leaves With a Given Value
Medium
Trees
Recursion
DFS (Depth-First Search)
★
Binary Tree Traversal
LeetCode #1325
Diameter of Binary Tree
Easy
Trees
Recursion
DFS (Depth-First Search)
★
Binary Tree Traversal
LeetCode #543
Generate Parentheses
Medium
Strings
Recursion
Backtracking
★
LeetCode #22
Invert Binary Tree
Easy
Trees
Recursion
Binary Tree Traversal
DFS (Depth-First Search)
BFS (Breadth-First Search)
★
LeetCode #226
Kth Smallest Element in a BST
Medium
Trees
Recursion
DFS (Depth-First Search)
★
Binary Tree Traversal
LeetCode #230
Letter Combinations of a Phone Number
Medium
Strings
Recursion
Hash Tables
Backtracking
★
LeetCode #17
Matchsticks to Square
Medium
Arrays
Recursion
Backtracking
★
LeetCode #473
Maximum Depth of Binary Tree
Easy
Trees
Recursion
DFS (Depth-First Search)
BFS (Breadth-First Search)
★
Binary Tree Traversal
LeetCode #104
Merge Two Sorted Lists
Easy
Recursion
Linked Lists
Two Pointers
★
LeetCode #21
Palindrome Partitioning
Medium
Strings
Recursion
Dynamic Programming
Backtracking
Dynamic Programming
★
LeetCode #131
Partition to K Equal Sum Subsets
Medium
Arrays
Recursion
Dynamic Programming
Backtracking
★
LeetCode #698
Permutations II
Medium
Arrays
Recursion
Sorting
Backtracking
★
LeetCode #47
Permutations
Medium
Arrays
Recursion
Backtracking
★
LeetCode #46