DSA Roadmap

Step by step guide to becoming a expert in DSA in 2025

Step 1

Introduction to Data Structures

What are Data Structures?

Abstract Data Types (ADTs)

Algorithms Basics

Time Complexity

Space Complexity

Step 2

Arrays

Introduction to Arrays

Dynamic Arrays

Array-based Data Structures

Common Operations on Arrays

Step 3

Linked Lists

Introduction to Linked Lists

Doubly Linked Lists

Circular Linked Lists

Common Operations on Linked Lists

Step 4

Stacks

Introduction to Stacks

Stack Operations

Applications of Stacks

Step 5

Queues

Introduction to Queues

Queue Operations

Applications of Queues

Double-ended Queues (Deque)

Step 6

Hash Tables

Introduction to Hash Tables

Hash Functions

Handling Collisions

Applications of Hash Tables

Step 7

Heaps

Introduction to Heaps

Binary Heaps

Heap Operations

Applications of Heaps

Step 8

Trees

Introduction to Trees

Binary Trees

Binary Search Trees

Tree Traversal

AVL Trees

Red-Black Trees

B-Trees

Step 9

Graphs

Introduction to Graphs

Graph Traversal Algorithms

Depth-First Search (DFS)

Breadth-First Search (BFS)

Dijkstra’s Algorithm

A* Search Algorithm

Topological Sorting

Step 10

Sorting Algorithms

Introduction to Sorting Algorithms

Bubble Sort

Selection Sort

Insertion Sort

Merge Sort

Quick Sort

Heap Sort

Counting Sort

Radix Sort

Step 11

Searching Algorithms

Introduction to Searching Algorithms

Linear Search

Binary Search

Depth-First Search (DFS)

Breadth-First Search (BFS)

Step 12

Recursion

Introduction to Recursion

Basic Recursive Algorithms

Tail Recursion

Memoization

Dynamic Programming

Step 13

Greedy Algorithms

Introduction to Greedy Algorithms

Common Greedy Algorithms

Fractional Knapsack Problem

Huffman Coding

Job Sequencing Problem

Step 14

Dynamic Programming

Introduction to Dynamic Programming

0/1 Knapsack Problem

Longest Common Subsequence

Longest Increasing Subsequence

Coin Change Problem

Step 15

Backtracking

Introduction to Backtracking

N-Queen Problem

Sudoku Solver

Rat in a Maze

Graph Coloring

Step 16

Divide and Conquer

Introduction to Divide and Conquer

Merge Sort

Quick Sort

Strassen’s Matrix Multiplication

Closest Pair of Points

Step 17

Bit Manipulation

Introduction to Bit Manipulation

Bitwise Operators

Common Bit Manipulation Tricks

Single Number Problems

Step 18

Computational Geometry

Introduction to Computational Geometry

Line Segment Intersection

Convex Hull Algorithms

Closest Pair of Points

Voronoi Diagrams

Step 19

Pattern Matching

Introduction to Pattern Matching

Knuth-Morris-Pratt Algorithm

Rabin-Karp Algorithm

Boyer-Moore Algorithm

Finite State Machines

Step 20

Number Theory

Introduction to Number Theory

Prime Numbers

Sieve of Eratosthenes

Greatest Common Divisor

Modular Arithmetic

Fibonacci Numbers

Step 21

Mathematical Optimization

Introduction to Optimization

Linear Programming

Dynamic Programming

Integer Programming

Nonlinear Programming

Step 22

Graph Theory

Introduction to Graph Theory

Eulerian Paths and Circuits

Hamiltonian Paths and Circuits

Graph Coloring

Network Flow

Step 23

Advanced Data Structures

Fibonacci Heaps

Suffix Trees

Tries

Segment Trees

Binary Indexed Trees

Step 24

Approximation Algorithms

Introduction to Approximation Algorithms

Traveling Salesman Problem

Vertex Cover

Set Cover

Max Cut

Step 25

Computational Complexity Theory

Introduction to Computational Complexity

P vs NP Problem

NP-Completeness

Time Hierarchy Theorem

Space Hierarchy Theorem

Step 26

Algorithmic Paradigms

Divide and Conquer

Greedy Algorithms

Dynamic Programming

Backtracking

Branch and Bound

Step 27

Parallel Algorithms

Introduction to Parallel Algorithms

MapReduce

Parallel Prefix Sum

PRAM Model

Bulk Synchronous Parallel

Step 28

Randomized Algorithms

Introduction to Randomized Algorithms

Monte Carlo Algorithms

Las Vegas Algorithms

Randomized Quickselect

Randomized Incremental Algorithms

Step 29

Game Theory

Introduction to Game Theory

Nash Equilibrium

Zero-Sum Games

Cooperative Games

Non-Cooperative Games