🗺️ DSA Learning Roadmap

flowchart TD

Start((Start))

subgraph Fundamentals
A(Array & Hashing)
B(Two Pointers)
C[Stack]
D(Sliding Window)
end

subgraph Search
E(Binary Search)
end

subgraph Linked_Structures
F(Linked List)
end

subgraph Trees_and_Heaps
G[Trees]
H[Tries]
I(Heap / Priority Queue)
end

subgraph Recursion_and_Backtracking
J(Backtracking)
end

subgraph Graphs
K[Graphs]
L(Advanced Graphs)
end

subgraph Dynamic_Programming
M(1-D DP)
N(2-D DP)
end

subgraph Greedy_and_Intervals
O[Greedy]
P[Intervals]
end

subgraph Misc
Q(Bit Manipulation)
R(Math & Geometry)
S[Sorting]
end


Start --> A
A --> B
A --> C

B --> D
B --> E
B --> F

E --> G
F --> G

G --> H
G --> I
G --> J

J --> K
I --> L
K --> L

J --> M
K --> N
M --> N

I --> O
I --> P

M --> Q

K --> R
Q --> R

A --> S
S --> E
🗺️ DSA Learning Roadmap

📊 Topic Progress
