Sorting
Bubble, insertion, selection, merge, quick and heap sort.
6 pages
Open hub9 hubs, 90 topic pages.
The Feynman workflow
Study the page, then record a 2–3 minute explanation on your phone. Each page ends with self-check questions, a timer, a checklist and a notes box to help you prepare.
Bubble, insertion, selection, merge, quick and heap sort.
6 pages
Open hubLinear, binary, interpolation, exponential, ternary, rotated arrays, peaks.
7 pages
Open hubArrays, linked lists, stacks, queues, deques, priority queues.
8 pages
Open hubBinary trees, BST, AVL, min- and max-heaps, B-trees.
6 pages
Open hubTraversals, shortest paths, spanning trees, topological sort, Union-Find.
11 pages
Open hubDivide and conquer, greedy, dynamic programming, backtracking, NP-completeness.
5 pages
Open hubParadigms, metrics, bias–variance, regularization, cross-validation, preprocessing, leakage.
8 pages
Open hubRegression, KNN, Naive Bayes, trees and ensembles, SVM, clustering and PCA.
14 pages
Open hubNeurons, training and optimisers, regularization, CNNs, RNNs, attention, Transformers, generative models.
25 pages
Open hub