HN repeatedly cites it as the definitive explanation of SwissTable, the design behind Abseil, Rust's hash map and Go's maps.
Topics › Mathematics & Theoretical CS
The best algorithms & data structures videos, according to Hacker News
58 videos about algorithms & data structures that Hacker News commenters keep pointing each other to, ranked by how many separate months they were recommended. Part of Mathematics & Theoretical CS.
HN repeatedly calls it a fantastic explanation that made FFT click, with some rewatching it periodically.
HN treats it as the definitive, engaging talk on hash table internals and Python dict ordering, and recommends it in tech-talk lists.
A perennial recommendation for anyone learning performance optimization, cited whenever hash tables, cache behavior or STL containers come up.
HN people point to it for rrb-trees, text editor data structures and bringing Clojure-style persistent structures to C++.
HN recommends it as an entertaining talk that starts simple and goes deep on practical performance optimization.
It is the default link in any thread about boarding or deplaning order, praised as an excellent, clear treatment.
HN commenters call it a must-watch for its deadpan, absurdly elaborate engineering and cite it for ideas like diluting strong engines with random moves.
HN readers recommend it as the best introduction to robust-first computing, where randomness and fault tolerance are built into the architecture.
HN fans love it for Knuth's humor and for how he makes open math problems feel approachable, and it is often cited for details like dancing links and counting rectangle subdivisions.
Strongly recommended as a beautiful demonstration that APL can be read and reasoned about step by step.
HN regards it as one of the best technical talks, a deep and clear walkthrough of scalable lock-free hash tables built on compare-and-swap.
HN recommends it as an accessible, engrossing lesson in queueing theory and systems design, even for people with no interest in Disney.
HN points to it as a clear explanation of immutable data structures such as tries, and of the case for immutability with React and Flux.
Strongly recommended as a clear, accessible survey of the CRDT landscape.
Recommended as an approachable introduction to CRDTs and the local-first idea behind apps like Actual.
HN commenters call it a beautiful, brilliant demonstration of APL's expressiveness and a model of clear narration.
HN points to it as a clear lesson that algebraic properties like associativity unlock parallelism, applicable in any language.
HN links it whenever menu hover problems or nearest-to-pointer selection come up, and as proof algorithms matter in front-end work.
Recommended as a clear introduction to dynamic programming from a well-regarded instructor.
Cited as a realistic, well-run example of a technical interview, both for candidates preparing and interviewers calibrating.
HN repeatedly recommends it as the best ground-up, non-hype introduction for people who want to understand what a blockchain actually is.
A classic that HN points to for seeing how sorting algorithms behave, valued for how satisfying it is to watch and hear.
HN points people to it as the explanation that finally made Fourier transforms and the FFT click, with a good historical story.
Commenters say it changes how you think about types and the STL, and makes a case for simple modern C++.
Commenters recommend it as the clearest way to understand WFC, especially in threads about Townscaper and tiled content generation.
HN calls it a surprisingly fun, approachable talk on a hard problem and cites it in floating-point threads.
Recommended as an intuitive, animated explanation of P vs NP framed around reversing computation.
HN recommends it as an instructive, easy-to-follow look at Lucene internals from a core committer.
HN recommends it as an approachable explanation that makes the famous algorithm finally make sense.
Recommended as an excellent first education on CRDTs and their limits.
HN recommends it as a clear, high-quality introduction to succinct data structures from a leading authority.
HN points to it as a vivid demo that plain A* search can beat fancier machine-learning approaches in game AI.
Recommended in cache-algorithm threads as a fun, informative walk through caching strategies and ARC.
HN recommends it as an entertaining demonstration of how powerful algorithmic gerrymandering can be.
HN points to it as a simple diff-and-patch alternative to operational transforms and CRDTs for collaborative editing.
HN people point to it for intuition about why some games are hard to navigate and for its Rush Hour and graph visualizations.
HN recommends it as a striking example of high-performance tree handling with array programming.
HN points to it as the best explanation of simdjson internals and of why fast parsing is rarely disk-bound.
HN recommends it as a memorable and fun way to visualize how sorting algorithms work.
Cited as an excellent look at Knuth's thinking and working style, and as a likely source for quotes about his habits.
HN points to it as the authoritative talk on Swiss tables, their design rationale, and real-world effects like Hyrum's law.
Recommended as a thorough, well-regarded explanation of hash table design tradeoffs and why the standard container is a poor choice.
HN people link it in discussions of taxi drivers' spatial memory and how cabbies handle roadworks and traffic.
HN commenters point to it as programming inspiration and as a source of Bentley's anecdotes about adding function by deleting code.
HN points to it as a solid, if long, introduction to B-epsilon trees and why BetrFS is built the way it is.
HN cites it as an excellent example of solving small cases to find a pattern, and as a favorite puzzle with an elegant binary solution.
HN recommends it as the go-to explanation of optimal Wordle openers like CRANE and a friendly introduction to information theory, also relevant to Mastermind.
HN recommends it as a careful, entertaining talk on low-level optimization that shows how textbook algorithms can be sped up.
Commenters credit it as the place they first learned about succinct data structures, and found it left a lasting impression.
HN shares it as a fun, memorable way to explain the longest path problem and as an entry in lists of programming and math songs.
HN points to it as the detailed explanation of why hexagons suit map grids, in threads about H3.
Cited as a fun example of how algorithmic changes can yield enormous performance gains.
HN fondly recalls it as the ideal visual demonstration of sorting algorithms and as the thing that got some people into programming.
Cited as the source for criticism of std::deque and move-constructor pitfalls, and as motivation to write custom data structures.
Used as the go-to citation in LeetCode and hiring debates that competitive programming skill is not a good signal for hiring.
Cited in discussions of voxel rendering, id Software's research and Euclideon-style claims as an early demonstration of the technique.
Used as a joke or aside about bubble sort and as evidence that Obama was tech savvy, not as something recommended for its content.
Which of these have you already seen?
Connect YouTube and HackerTube AI hides what you've watched and ranks the rest for you.