How this course works
The chapters and lessons below are the fixed course structure. When you start, LearnLive teaches each lesson interactively and adapts examples, pacing, and questions to you.
Complete syllabus
Every chapter and lesson
- 01
Chapter 1 · 3 lessons
Algorithmic Foundations
- 1.1
Algorithm analysis & Big-O
9 min · Quick check
- 1.2
Recursion
9 min · Quick check
- 1.3
Correctness & invariants
8 min · Quick check
- 1.1
- 02
Chapter 2 · 3 lessons
Linear Structures
- 2.1
Arrays & dynamic arrays
9 min · Quick check
- 2.2
Linked lists
8 min · Quick check
- 2.3
Stacks & queues
8 min · Quick check
- 2.1
- 03
Chapter 3 · 3 lessons
Sorting & Searching
- 3.1
Elementary sorts
8 min · Quick check
- 3.2
Merge & quicksort
9 min · Quick check
- 3.3
Binary search
8 min · Quick check
- 3.1
- 04
Chapter 4 · 3 lessons
Trees
- 4.1
Binary trees & traversals
9 min · Quick check
- 4.2
Binary search trees
9 min · Quick check
- 4.3
Balanced trees & heaps
8 min · Quick check
- 4.1
- 05
Chapter 5 · 3 lessons
Hashing & Maps
- 5.1
Hash tables
9 min · Quick check
- 5.2
Collision handling
8 min · Quick check
- 5.3
Sets & maps in practice
8 min · Quick check
- 5.1
- 06
Chapter 6 · 3 lessons
Graphs
- 6.1
Graph representations
8 min · Quick check
- 6.2
BFS & DFS
9 min · Quick check
- 6.3
Shortest paths & MSTs
9 min · Quick check
- 6.1