30-Day Full Curriculum
A month-long sampler that touches nearly every category on the platform, roughly one sitting per day. You will meet vectors, derivatives, distributions, regressions, neural nets, algorithms, graphs, and information theory in a single sweep. Ideal if you are new and want to discover which track to commit to next.
Your progress
0/33 · 0%Path readiness 0%Easy 0% · Medium 0% · Hard 0%
Continue path · Vector AdditionWhat you will learn
- Sample nearly every category with one focused sitting per day
- Build a mental map of the whole platform
- Finish with a synthesis week across maths, models, and evaluation
1Week 1: Mathematical Language
Start where every model starts: vectors, matrix products, cosine similarity, numerical derivatives, mean and variance, and expected value.
- Easy
- Easy
- Easy
- MeanEasyst-001Statistics
- VarianceEasyst-002Statistics
- Easy
- Medium
Stage checkpoint
0/2 to passA checkpoint is a short retrieval test drawn from this stage: solve 2 of 3 from memory to mark the stage complete. The stage stays open either way.
- Numerical DerivativeEasy
- VarianceEasy
- Cosine Similarity of VectorsMedium
2Week 2: Data and First Models
Turn data into predictions: correlation, accuracy and MSE, linear regression, k-fold splits, and binary search as an algorithm warm-up.
- AccuracyEasyml-008ML Fundamentals
- Easy
- Binary SearchEasyal-001Algorithms
- Medium
- Medium
- Medium
Stage checkpoint
0/2 to passA checkpoint is a short retrieval test drawn from this stage: solve 2 of 3 from memory to mark the stage complete. The stage stays open either way.
- Binary SearchEasy
- Pearson CorrelationMedium
- Linear RegressionMedium
3Week 3: Deep Learning and Optimization
Neural networks and how they train: ReLU, stable softmax, a stack simulation, an SGD update, gradient descent, and the k-means assignment step.
- ReLUEasydl-001Deep Learning
- Easy
- Easy
- Medium
- Medium
- Medium
Stage checkpoint
0/2 to passA checkpoint is a short retrieval test drawn from this stage: solve 2 of 3 from memory to mark the stage complete. The stage stays open either way.
4Week 4: Breadth Across Modalities
Broaden and consolidate: grayscale conversion, tokenization, first differences, adjacency lists, self-information, a probability classic, a full backprop gradient, and one k-means iteration.
- Easy
- TokenizationEasynlp-001NLP
- Easy
- Adjacency List BuildEasygraph-001Graph Algorithms
- Easy
- Hard
- Hard
- Hard
Stage checkpoint
0/2 to passA checkpoint is a short retrieval test drawn from this stage: solve 2 of 3 from memory to mark the stage complete. The stage stays open either way.
- RGB to GrayscaleEasy
- TokenizationEasy
- Mean Absolute ChangeEasy
5Week 5: Synthesis
Bring it together with a transformer encoder block, TF-IDF, bootstrap confidence intervals, maximum subarray, an Adam update, and the Hessian.
- Medium
- Medium
- Medium
- Hard
- Hard
- Hessian MatrixHardca-005Calculus
Stage checkpoint
0/2 to passA checkpoint is a short retrieval test drawn from this stage: solve 2 of 3 from memory to mark the stage complete. The stage stays open either way.
- TF-IDFMedium
- Maximum Subarray SumMedium
- Generic Adam UpdateMedium
Capstone
CollectionClose the path with one real artifact from the catalog.
One easy problem a day for a month continues exactly the breadth this path samples.