Course catalog
Choose structures from behavior and prove complexity with traces.
Trace complexity, arrays and maps, stacks and queues, binary search, trees and graphs, breadth-first search, and practical problem decomposition with executable invariants.
Section 1
Count steps to name growth with Big-O, then pick arrays and maps by the access pattern each one serves.
Section 2
Build stacks and queues from their access rules, then turn sorted input into one-pass two-pointer scans.
Section 3
Halve sorted candidates with binary search, store sparse graphs as neighbor lists, and explore them ring by ring with BFS.
Ship a secure TypeScript app built with AI in your workflow: tested algorithms, tools kept inside safe limits, architecture choices you can explain, and releases you can check after they go out.
16 course sequence
Build and share a tested full-stack React app: a screen everyone can use, data only its owner can see, APIs with clear limits, realtime updates that stay correct, and deploys you can roll back.
14 course sequence
Analyze real data and build tested tools that talk to outside APIs safely and search your own content, using Python, Git, SQL, and vector search.
10 course sequence
Eligible first-time members can get 7 free days · Cancel anytime
Get started