Algorithms

• Algorithms: What’s the problem?
• LLMs: Algorithms that break the rules
• The Thinker’s Guide to AI
• Tänkarens guide till AI
• Introduction to graph algorithms: definitions and examples
• Dynamic programming [step-by-step example]
• Las Vegas vs. Monte Carlo algorithms
• Blackjack card counting risk analysis: poor gains at huge risk
• What’s a seed in a random number generator?
• Generate all permutations

Data structures

• Time complexity of array/list operations [Java, Python]
• Hash tables explained [step-by-step example]
• How to avoid initializing memory [in theory]
• Binary search trees explained
• Treaps: Randomized search trees
• Bloom filters explained

• Your basic int: a most powerful data type

Sorting

• O(n log log n) time integer sorting
• Quicksort optimizations explained [complete code]
• Insertion sort vs. selection sort (time complexity and performance)
• Radix sorting basics

Correctness

• Loop invariants can give you coding superpowers
• On induction and recursive functions, with an application to binary search

Analysis

• How to analyze time complexity: Count your steps
• Big O notation: definition and examples
• The quadratic wall: Why LLM context windows are expensive
• Time complexity of recursive functions [Master theorem]
• Unit cost vs. bit cost in time complexity
• Amortized time complexity

Software engineering

• API design: principles and best practices
• Object-oriented programming without inheritance
• Functional programming in Go [case study]

Top programming languages

• Top programming languages in use 2000-2020 [informal study]