L1
Honest Take — Before You Begin
---
locked
Course · 7 lessons
~35 hr
Intermediate
Foundations — Mathematical Thinking & Problem Solving
Build the mathematical maturity needed to read algorithm textbooks, understand asymptotic analysis, write proofs by induction, and reason about recurrence relations. This is not a math course — it is the minimum mathematical toolkit for everything that follows.
reading · we frame, you read MIT or the canonical
taught · we author, no canonical fits
↺ spirals back to earlier lessons
L2
Read: Grokking Algorithms (Bhargava)
Approach: YOUR BOOK
primary
MIT 6.006 Lectures 1-3
locked
L3
Read: How To Solve It (Polya)
Approach: YOUR BOOK
primary
MIT 6.006 Lectures 1-3
locked
L4
Read: Algorithms Unlocked (Cormen)
Approach: YOUR BOOK
primary
MIT 6.006 Lectures 1-3
locked
L5
Read: A Programmer's Introduction to Mathematics (Kun)
Approach: YOUR BOOK
primary
MIT 6.006 Lectures 1-3
locked
L6
Module Checklist
Work through each item before the checkpoint.
locked
L7
Checkpoint: Write a Ruby script that implements 5 different algorithm...
Write a Ruby script that implements 5 different algorithms at different complexity classes (O(1), O(log n), O(n), O(n log n), O(n^2)). Benchmark each with Ruby's Benchmark module …
locked
7 lessons. Read in order; spiral back when you need to. By the end you'll have used the core ideas twice — once on the abstract, once on something you'll meet at work next week.