Data Structures & Algorithms: Foundations

The 80% every engineer needs, from first principles. Complexity, the memory hierarchy, the core structures, and the algorithms built on each.

Lessons
17
Modules
5
Running time
4h 34m
Before you start
Comfortable reading code
Free to watch
Every lesson
Last updated
Jun 22, 2026

Part of

[01] Who it's for

  • Self-taught developers filling in the computer science they skipped.
  • Engineers who learned data structures once and want the cost model behind them, not just the names.
  • Anyone who wants to know why one data structure is faster than another, instead of memorizing patterns.

[02] What you'll learn

  • 01Reason about big-O, amortized cost, and why the memory hierarchy makes arrays fast
  • 02Build every core structure from scratch: dynamic arrays, hash tables, trees, heaps
  • 03Reach for two pointers, sliding window, and binary search without thinking
  • 04Implement merge, quick, and heap sort and know which one a real library reaches for
  • 05Traverse graphs with BFS and DFS, the patterns every later graph algorithm builds on

[03] Syllabus

Module 01

The cost of everything

4 lessons53 min
  1. 01

    Complexity: big-O, amortized, and the cost model that matters

    14m
  2. 02

    The memory hierarchy: why arrays are fast

    14m
  3. 03

    Arrays and dynamic arrays from scratch

    13m
  4. 04

    Strings: immutability, builders, and the hidden O(n)

    13m

  5. Module quiz

    5 questions, about 5 minutes

Module 02

Linear structures and their patterns

4 lessons69 min
  1. 05

    Linked lists: when they actually beat arrays

    17m
  2. 06

    Stacks and queues: the workhorses

    16m
  3. 07

    Two pointers and sliding window

    17m
  4. 08

    Binary search: one template for every variant

    19m

  5. Module quiz

    5 questions, about 5 minutes

Module 03

Recursion and sorting

3 lessons49 min
  1. 09

    Thinking recursively: the call stack made concrete

    14m
  2. 10

    Comparison sorts: merge, quick, and how libraries sort

    21m
  3. 11

    Divide and conquer

    14m

  4. Module quiz

    5 questions, about 5 minutes

Module 04

Hashing and trees

4 lessons66 min
  1. 12

    Hash tables: collisions, load factor, and resizing

    17m
  2. 13

    Binary trees and the four traversals

    16m
  3. 14

    Binary search trees and the degenerate case

    16m
  4. 15

    Heaps, priority queues, and heap sort

    17m

  5. Module quiz

    5 questions, about 5 minutes

Module 05

First steps into graphs

2 lessons37 min
  1. 16

    Representing graphs: adjacency list vs matrix

    14m
  2. 17

    BFS and DFS: the traversal patterns everything builds on

    23m

  3. Module quiz

    5 questions, about 5 minutes

  1. Certificate

    Finish every lesson and pass every module quiz

[04] Questions

Is this just LeetCode prep?
Interview readiness is a side effect, not the goal. Each structure is taught with the production system it powers, so you understand why it exists, not just how to pass a test.
What language is the code in?
Lessons teach with pseudocode and diagrams so the idea stays language-agnostic. The written companion below each video carries full TypeScript, Go, and C++ implementations.
What if I can't afford a plan?
Email mail@karnstack.com from a student address (.edu, .ac.in, or equivalent) and we'll work something out.
Is there a refund?
Yes. 7 days, no questions, mail@karnstack.com.

[05] How it's made

The curriculum is curated by karnstack and reviewed by senior engineers in the industry before it ships. Narration is an AI voice (ElevenLabs) reading human-written, human-reviewed scripts. Read how courses are made.