Topics (71)
Master each topic systematically
Topic
Problems
Difficulty
Progress
Action
Array
2204
Med-Hard
0%
Practice
ArrayAdvanced
2204 problemsPractice
Backtracking
111
Med-Hard
0%
Practice
BacktrackingAdvanced
111 problemsPractice
Biconnected Component
1
Easy
0%
Practice
Biconnected ComponentBeginner
1 problemPractice
Binary Indexed Tree
48
Easy
0%
Practice
Binary Indexed TreeBeginner
48 problemsPractice
Binary Search
349
Med-Hard
0%
Practice
Binary SearchAdvanced
349 problemsPractice
Binary Search Tree
41
Easy
0%
Practice
Binary Search TreeBeginner
41 problemsPractice
Binary Tree
179
Med-Hard
0%
Practice
Binary TreeAdvanced
179 problemsPractice
Bit Manipulation
282
Med-Hard
0%
Practice
Bit ManipulationAdvanced
282 problemsPractice
Bitmask
56
Mixed
0%
Practice
BitmaskIntermediate
56 problemsPractice
Brainteaser
21
Easy
0%
Practice
BrainteaserBeginner
21 problemsPractice
Breadth-First Search
257
Med-Hard
0%
Practice
Breadth-First SearchAdvanced
257 problemsPractice
Bucket Sort
6
Easy
0%
Practice
Bucket SortBeginner
6 problemsPractice
Combinatorics
63
Mixed
0%
Practice
CombinatoricsIntermediate
63 problemsPractice
Concurrency
9
Easy
0%
Practice
ConcurrencyBeginner
9 problemsPractice
Counting
200
Med-Hard
0%
Practice
CountingAdvanced
200 problemsPractice
Counting Sort
10
Easy
0%
Practice
Counting SortBeginner
10 problemsPractice
Data Stream
21
Easy
0%
Practice
Data StreamBeginner
21 problemsPractice
Database
291
Med-Hard
0%
Practice
DatabaseAdvanced
291 problemsPractice
Depth-First Search
338
Med-Hard
0%
Practice
Depth-First SearchAdvanced
338 problemsPractice
Design
132
Med-Hard
0%
Practice
DesignAdvanced
132 problemsPractice
Divide and Conquer
66
Mixed
0%
Practice
Divide and ConquerIntermediate
66 problemsPractice
Doubly-Linked List
13
Easy
0%
Practice
Doubly-Linked ListBeginner
13 problemsPractice
Dynamic Programming
668
Med-Hard
0%
Practice
Dynamic ProgrammingAdvanced
668 problemsPractice
Enumeration
149
Med-Hard
0%
Practice
EnumerationAdvanced
149 problemsPractice
Eulerian Circuit
3
Easy
0%
Practice
Eulerian CircuitBeginner
3 problemsPractice
Game Theory
30
Easy
0%
Practice
Game TheoryBeginner
30 problemsPractice
Geometry
45
Easy
0%
Practice
GeometryBeginner
45 problemsPractice
Graph
189
Med-Hard
0%
Practice
GraphAdvanced
189 problemsPractice
Greedy
483
Med-Hard
0%
Practice
GreedyAdvanced
483 problemsPractice
Hash Function
43
Easy
0%
Practice
Hash FunctionBeginner
43 problemsPractice
Hash Table
788
Med-Hard
0%
Practice
Hash TableAdvanced
788 problemsPractice
Heap (Priority Queue)
212
Med-Hard
0%
Practice
Heap (Priority Queue)Advanced
212 problemsPractice
Interactive
23
Easy
0%
Practice
InteractiveBeginner
23 problemsPractice
Iterator
9
Easy
0%
Practice
IteratorBeginner
9 problemsPractice
Line Sweep
5
Easy
0%
Practice
Line SweepBeginner
5 problemsPractice
Linked List
81
Mixed
0%
Practice
Linked ListIntermediate
81 problemsPractice
Math
684
Med-Hard
0%
Practice
MathAdvanced
684 problemsPractice
Matrix
277
Med-Hard
0%
Practice
MatrixAdvanced
277 problemsPractice
Memoization
42
Easy
0%
Practice
MemoizationBeginner
42 problemsPractice
Merge Sort
16
Easy
0%
Practice
Merge SortBeginner
16 problemsPractice
Minimum Spanning Tree
6
Easy
0%
Practice
Minimum Spanning TreeBeginner
6 problemsPractice
Monotonic Queue
25
Easy
0%
Practice
Monotonic QueueBeginner
25 problemsPractice
Monotonic Stack
72
Mixed
0%
Practice
Monotonic StackIntermediate
72 problemsPractice
Number Theory
95
Mixed
0%
Practice
Number TheoryIntermediate
95 problemsPractice
Ordered Set
78
Mixed
0%
Practice
Ordered SetIntermediate
78 problemsPractice
Prefix Sum
246
Med-Hard
0%
Practice
Prefix SumAdvanced
246 problemsPractice
Probability and Statistics
7
Easy
0%
Practice
Probability and StatisticsBeginner
7 problemsPractice
Queue
58
Mixed
0%
Practice
QueueIntermediate
58 problemsPractice
Quickselect
8
Easy
0%
Practice
QuickselectBeginner
8 problemsPractice
Radix Sort
3
Easy
0%
Practice
Radix SortBeginner
3 problemsPractice
Randomized
12
Easy
0%
Practice
RandomizedBeginner
12 problemsPractice
Recursion
50
Mixed
0%
Practice
RecursionIntermediate
50 problemsPractice
Rejection Sampling
2
Easy
0%
Practice
Rejection SamplingBeginner
2 problemsPractice
Reservoir Sampling
4
Easy
0%
Practice
Reservoir SamplingBeginner
4 problemsPractice
Rolling Hash
33
Easy
0%
Practice
Rolling HashBeginner
33 problemsPractice
Segment Tree
80
Mixed
0%
Practice
Segment TreeIntermediate
80 problemsPractice
Shell
4
Easy
0%
Practice
ShellBeginner
4 problemsPractice
Shortest Path
41
Easy
0%
Practice
Shortest PathBeginner
41 problemsPractice
Simulation
209
Med-Hard
0%
Practice
SimulationAdvanced
209 problemsPractice
Sliding Window
162
Med-Hard
0%
Practice
Sliding WindowAdvanced
162 problemsPractice
Sorting
502
Med-Hard
0%
Practice
SortingAdvanced
502 problemsPractice
Stack
179
Med-Hard
0%
Practice
StackAdvanced
179 problemsPractice
String
874
Med-Hard
0%
Practice
StringAdvanced
874 problemsPractice
String Matching
37
Easy
0%
Practice
String MatchingBeginner
37 problemsPractice
Strongly Connected Component
3
Easy
0%
Practice
Strongly Connected ComponentBeginner
3 problemsPractice
Suffix Array
9
Easy
0%
Practice
Suffix ArrayBeginner
9 problemsPractice
Topological Sort
38
Easy
0%
Practice
Topological SortBeginner
38 problemsPractice
Tree
264
Med-Hard
0%
Practice
TreeAdvanced
264 problemsPractice
Trie
60
Mixed
0%
Practice
TrieIntermediate
60 problemsPractice
Two Pointers
251
Med-Hard
0%
Practice
Two PointersAdvanced
251 problemsPractice
Union Find
98
Mixed
0%
Practice
Union FindIntermediate
98 problemsPractice
Master DSA Topics for Coding Interviews
Data Structures and Algorithms form the foundation of every coding interview at top tech companies. Whether you're preparing for interviews at Google, Amazon, Microsoft, or any startup, mastering these DSA topics is essential for success.
Essential DSA Topics to Master
- Arrays & Strings: The most common topic in coding interviews - two pointers, sliding window, prefix sums
- Trees & Graphs: BFS, DFS, binary search trees, shortest path algorithms
- Dynamic Programming: Memoization, tabulation, common DP patterns like knapsack and LCS
- Sorting & Searching: Binary search variations, merge sort, quick sort, and custom comparators
- Stack & Queue: Monotonic stacks, priority queues, BFS with queues
- Hash Tables: Frequency counting, two sum patterns, and collision handling
How to Use FleetCode Topics
Select any topic above to see all related coding problems organized by difficulty level. Start with Easy problems to build your foundation, then progress to Medium and Hard challenges. Each topic includes problems frequently asked in real interviews at top companies.