← All tracks
Algorithms & Data Structures
Hash maps, two pointers, graphs, dynamic programming and heaps — the patterns that come up again and again in coding interviews.
Software EngineerSWE InternPlatform Engineer
Track progress0 / 129
0/22Unit 1: 3 to go
Foundations
Unit 1
Binary Search & Heaps
0 / 5 solved
Start
Unit 2
Stacks & Dynamic Programming
0 / 5 solved
Unit 3
Arrays & Two Pointers
0 / 5 solved
Unit 4
Sorting & Two Pointers
0 / 5 solved
Unit 5
Trees
0 / 5 solved
Unit 6
Matrices
0 / 5 solved
Unit 7
BFS I
0 / 6 solved
Intermediate
Unit 8
Graphs I
0 / 3 solved
Unit 9
Graphs II
0 / 3 solved
Unit 10
Sliding Windows
0 / 4 solved
Unit 11
Dynamic Programming I
0 / 3 solved
Unit 12
Dynamic Programming II
0 / 4 solved
Unit 13
Heaps & Binary Search
0 / 5 solved
Unit 14
Strings & BFS
0 / 4 solved
Unit 15
Two Pointers & Backtracking
0 / 5 solved
Unit 16
Backtracking
0 / 4 solved
Unit 17
Greedy & Trees
0 / 4 solved
Unit 18
Linked Lists
0 / 4 solved
Unit 19
Selection
0 / 4 solved
Unit 20
Data Structures
0 / 5 solved
Advanced
Unit 21 · Pro
Dynamic Programming III
0 / 0 solved
Unit 22
Graphs III
0 / 1 solved
Unit 23 · Pro
Trees & Graphs
0 / 0 solved
Unit 24
Heaps
0 / 3 solved
Unit 25 · Pro
BFS II
0 / 0 solved
Course complete
Clear every milestone to finish Algorithms & Data Structures.