← Goal templates
Algorithms and data structures
The interview and exam staples, understood rather than memorised.
Learn the core algorithms and data structures: Big O, arrays, linked lists, hash tables, sorting, searching and dynamic programming, with freeCodeCamp's full course and clear reference articles.
intermediateabout 4 weeks at 60 min a day4 free sources
What you'll cover
Phase 1
Analysis
- Big O notation
- Time and space complexity
Phase 2
Data structures
- Arrays and linked lists
- Hash tables
- Trees
Phase 3
Algorithms
- Searching
- Sorting
- Recursion
- Dynamic programming
An outline. Your own plan is made when you start, around your level and deadline.
Sources
Free, and fetched for you
- LectureAlgorithms and Data Structures, Full Course for Beginners (freeCodeCamp)youtube.com ↗
- Web pageBig O notation (Wikipedia)en.wikipedia.org ↗
- Web pageHash table (Wikipedia)en.wikipedia.org ↗
- Web pageDynamic programming (Wikipedia)en.wikipedia.org ↗
All sources belong to their creators and are free to watch or read; Confu links to them and turns them into study PDFs for you.
More templates
- Neural networks from scratchFrom a single neuron to backpropagation you could code yourself.
- Transformers and large language modelsHow ChatGPT-style models work, down to attention and a GPT you build yourself.
- Reinforcement learning, from basics to PPOAgents, rewards and policies, up to the algorithm behind RLHF.
- Linear algebra, the visual wayVectors, matrices and eigenvectors you can actually picture.