Topics (26)
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
Binary Search
349
Med-Hard
0%
Practice
Binary SearchAdvanced
349 problemsPractice
Binary Tree
179
Med-Hard
0%
Practice
Binary TreeAdvanced
179 problemsPractice
Bit Manipulation
282
Med-Hard
0%
Practice
Bit ManipulationAdvanced
282 problemsPractice
Breadth-First Search
257
Med-Hard
0%
Practice
Breadth-First SearchAdvanced
257 problemsPractice
Counting
200
Med-Hard
0%
Practice
CountingAdvanced
200 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
Dynamic Programming
668
Med-Hard
0%
Practice
Dynamic ProgrammingAdvanced
668 problemsPractice
Enumeration
149
Med-Hard
0%
Practice
EnumerationAdvanced
149 problemsPractice
Graph
189
Med-Hard
0%
Practice
GraphAdvanced
189 problemsPractice
Greedy
483
Med-Hard
0%
Practice
GreedyAdvanced
483 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
Math
684
Med-Hard
0%
Practice
MathAdvanced
684 problemsPractice
Matrix
277
Med-Hard
0%
Practice
MatrixAdvanced
277 problemsPractice
Prefix Sum
246
Med-Hard
0%
Practice
Prefix SumAdvanced
246 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
Tree
264
Med-Hard
0%
Practice
TreeAdvanced
264 problemsPractice
Two Pointers
251
Med-Hard
0%
Practice
Two PointersAdvanced
251 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.