Skip to main content

Topics (33)

Master each topic systematically

Biconnected ComponentBeginner
1 problemPractice
Binary Indexed TreeBeginner
48 problemsPractice
Binary Search TreeBeginner
41 problemsPractice
BrainteaserBeginner
21 problemsPractice
Bucket SortBeginner
6 problemsPractice
ConcurrencyBeginner
9 problemsPractice
Counting SortBeginner
10 problemsPractice
Data StreamBeginner
21 problemsPractice
Doubly-Linked ListBeginner
13 problemsPractice
Eulerian CircuitBeginner
3 problemsPractice
Game TheoryBeginner
30 problemsPractice
GeometryBeginner
45 problemsPractice
Hash FunctionBeginner
43 problemsPractice
InteractiveBeginner
23 problemsPractice
IteratorBeginner
9 problemsPractice
Line SweepBeginner
5 problemsPractice
MemoizationBeginner
42 problemsPractice
Merge SortBeginner
16 problemsPractice
Minimum Spanning TreeBeginner
6 problemsPractice
Monotonic QueueBeginner
25 problemsPractice
Probability and StatisticsBeginner
7 problemsPractice
QuickselectBeginner
8 problemsPractice
Radix SortBeginner
3 problemsPractice
RandomizedBeginner
12 problemsPractice
Rejection SamplingBeginner
2 problemsPractice
Reservoir SamplingBeginner
4 problemsPractice
Rolling HashBeginner
33 problemsPractice
ShellBeginner
4 problemsPractice
Shortest PathBeginner
41 problemsPractice
String MatchingBeginner
37 problemsPractice
Strongly Connected ComponentBeginner
3 problemsPractice
Suffix ArrayBeginner
9 problemsPractice
Topological SortBeginner
38 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.