ViewTube

Build an intuitive mental model of core data structures and algorithms using relatable, real-world analogies. Topics range from ...

Welcome to the Complete Data Structures and Algorithms (DSA) course! In this video, we explore the essential concepts of DSA ...

The cost of sorting and searching, operation by operation — big-O, and the traps that bite in practice. We build the complexity ...

When to reach for sorting and searching — and when not to. The design tradeoffs, side by side. We compare sorting and ...

The cost of every graph algorithm operation in one place — big-O, and the traps that bite in practice. We build the complexity table ...

When to reach for range query structures — and when not to. The design tradeoffs, side by side. We compare range query ...

The invariants of graph representations: the facts that must stay true after every operation. We state each invariant plainly and ...

Searching on tries — finding an element, and how many places you have to look. This lesson shows exactly what happens, step ...

When to reach for tries — and when not to. The design tradeoffs, side by side. We compare tries against the alternatives so you ...

The Traversal abstract data type: describing the type by what it promises, not how it's built. We separate the interface (the ...

The invariants of range query structures: the facts that must stay true after every operation. We state each invariant plainly and ...

How disjoint set union actually lives in memory — the byte-level layout behind the abstraction. We map the abstract picture onto ...

Stop scanning a range element by element: precompute a running total once, and every range sum becomes a single subtraction.

Three ideas hold this chapter together: relaxation, spanning trees and topological order. Before any single algorithm, we name the ...

The DSU abstract data type: describing the type by what it promises, not how it's built. We separate the interface (the operations ...

A tight recap of sorting and searching: the mental model, the operations, and the costs — everything worth keeping. The essential ...

The invariants of graph traversal: the facts that must stay true after every operation. We state each invariant plainly and show how ...

The invariants of sorting and searching: the facts that must stay true after every operation. We state each invariant plainly and ...

The bugs people actually hit with graph traversal — shown, explained, and fixed. A gallery of real mistakes: what they look like, ...

When to reach for graph algorithms — and when not to. The design tradeoffs, side by side. We compare graph algorithms against ...