DSA Learning Roadmap

Master Data Structures & Algorithms step by step

Level 1
Foundations
📊
Arrays & Hashing

Hash maps, sets, frequency counting

Progress0/9
Level 2
Core Patterns
🔒
Two Pointers

Sorted arrays, pairs, in-place ops

Progress0/5
🔒
Sliding Window

Subarrays, substrings, fixed/variable window

Progress0/4
🔒
Stack

LIFO, parentheses, monotonic stack

Progress0/6
🔒
Binary Search

O(log n) search, search space reduction

Progress0/13
Level 3
Data Structures
🔒
Linked List

Pointers, reversal, cycle detection

Progress0/9
🔒
Trees

DFS, BFS, BST properties

Progress0/23
🔒
Heap / Priority Queue

Top K, median, scheduling

Progress0/4
Level 4
Advanced Techniques
🔒
Backtracking

Combinations, permutations, constraint satisfaction

Progress0/10
🔒
Graphs

DFS, BFS, topological sort, shortest path

Progress0/8
🔒
Dynamic Programming

Memoization, tabulation, optimal substructure

Progress0/10
Level 5
Specialized Topics
🔒
Intervals

Merge, insert, overlap detection

Progress0/6
🔒
Greedy

Local optimal → global optimal

Progress0/8
🔒
Matrix

2D traversal, rotation, spiral

Progress0/3