Topics (26)
Master each topic systematically
Topic
Problems
Difficulty
Progress
Action
Array
2237
Med-Hard
0%
Practice
ArrayAdvanced
2237 problemsPractice
Backtracking
111
Med-Hard
0%
Practice
BacktrackingAdvanced
111 problemsPractice
Binary Search
357
Med-Hard
0%
Practice
Binary SearchAdvanced
357 problemsPractice
Binary Tree
179
Med-Hard
0%
Practice
Binary TreeAdvanced
179 problemsPractice
Bit Manipulation
286
Med-Hard
0%
Practice
Bit ManipulationAdvanced
286 problemsPractice
Breadth-First Search
257
Med-Hard
0%
Practice
Breadth-First SearchAdvanced
257 problemsPractice
Counting
203
Med-Hard
0%
Practice
CountingAdvanced
203 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
673
Med-Hard
0%
Practice
Dynamic ProgrammingAdvanced
673 problemsPractice
Enumeration
153
Med-Hard
0%
Practice
EnumerationAdvanced
153 problemsPractice
Graph
190
Med-Hard
0%
Practice
GraphAdvanced
190 problemsPractice
Greedy
485
Med-Hard
0%
Practice
GreedyAdvanced
485 problemsPractice
Hash Table
797
Med-Hard
0%
Practice
Hash TableAdvanced
797 problemsPractice
Heap (Priority Queue)
213
Med-Hard
0%
Practice
Heap (Priority Queue)Advanced
213 problemsPractice
Math
691
Med-Hard
0%
Practice
MathAdvanced
691 problemsPractice
Matrix
279
Med-Hard
0%
Practice
MatrixAdvanced
279 problemsPractice
Prefix Sum
252
Med-Hard
0%
Practice
Prefix SumAdvanced
252 problemsPractice
Simulation
212
Med-Hard
0%
Practice
SimulationAdvanced
212 problemsPractice
Sliding Window
166
Med-Hard
0%
Practice
Sliding WindowAdvanced
166 problemsPractice
Sorting
508
Med-Hard
0%
Practice
SortingAdvanced
508 problemsPractice
Stack
182
Med-Hard
0%
Practice
StackAdvanced
182 problemsPractice
String
877
Med-Hard
0%
Practice
StringAdvanced
877 problemsPractice
Tree
264
Med-Hard
0%
Practice
TreeAdvanced
264 problemsPractice
Two Pointers
252
Med-Hard
0%
Practice
Two PointersAdvanced
252 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.