Data Structures & Algorithms
Pick a Language
JavaScript
Java
Go
C#
C++
Python
Rust Ruby
Programming Fundamentals
Language Syntax
Control Structures
Functions
OOP Basics
Pseudo Code
What are Data Structures?
Why are Data Structures Important?
Basic Data Structures
Array Linked Lists
StacksQueues
Hash Tables
Algorithmic Complexity
Time vs Space Complexity
How to Calculate Complexity?
Common Runtimes
Constant
Logarithmic
Linear
Polynomial
Exponential
Factorial
Asymptotic Notation
Big-O Notation
Big-θ Notation
Big-Ω Notation
Sorting Algorithms
Bubble Sort Merge Sort
Insertion Sort Quick Sort
Selection Sort
Heap Sort
Search Algorithms
Linear Search
Binary Search
Tree Data Structures
Tree Traversal Search Algorithms
Breadth First Search
Depth First Search
In-Order Traversal
Pre-Order Traversal
Post-Order Traversal
Binary Trees
Binary Search Trees
AVL Trees
B-Trees
Graph Data Structures
Directed Graph
Undirected Graph
Search Algorithms
Breadth First Search
Depth First Search
Shortest Path Algorithms
Dijkstra's Algorithm
Bellman-Ford Algoritm
Minimum Spanning Tree
Prim's Algorithm
Kruskal's Algorithm
Advanced Data Structures
Trie
Segment Trees
Fenwick Trees
Disjoint Set (Union-Find)
Suffix Trees and Arrays
Complex Data Structures
B/B+ Trees
Skip List
ISAM
2-3 Trees Indexing
Linear
Tree-Based
Problem Solving Techniques
Brute Force Backtracking
Greedy Algorithms
Randomised Algorithms
Divide and COnquer
Recursion
Dynamic Programming
Two Pointer Technique
Sliding Window Technique
Platforms to Practice
Leetcode
Edabit
Find the interactive version
of this roadmap and more at
roadmap.sh
Related Roadmaps
Computer Science
Programming Languages
System Design
Software Design & Architecture
Continue learning with following roadmaps
Computer Science System Design
Fast and Slow Pointers
Cyclic Sort
Merge Intervals
Kth ElementTwo Heaps
Multi-threaded
Island traversal
Heap
A* Algorithm
