← All courses
🧮Beginner
Complexity & Problem-Solving Foundations
The lens for everything that follows: how to reason about algorithms, Big-O/Θ/Ω, analyzing time and space, amortized cost, recursion and the call stack, and a repeatable method for attacking any coding problem.
Volume 4 · Part I · 7 chapters · 7 lessons
Share
Free
What you'll learn
- How to Think About Algorithms
- Big-O, Big-Θ & Big-Ω
- Analyzing Time Complexity
- Space Complexity
- Amortized Analysis
- Recursion & the Call Stack
- How to Attack a Coding Problem
Curriculum
3 modules · 7 lessonsModule 1Thinking About Algorithms3 lessons
How to Think About AlgorithmsPreviewBig-O, Big-Θ & Big-Ω
Analyzing Time Complexity
Module 2The Cost of Code2 lessons
Space Complexity
Amortized Analysis
Module 3Recursion & Strategy2 lessons
Recursion & the Call Stack
How to Attack a Coding Problem
Reviews
No reviews yet.
