karnstack
data structures & algorithms - foundations
17 lessons · 4h 34m
the cost of everything
0
/4
complexity: big-o, amortized, and the cost model that matters
14m
the memory hierarchy: why arrays are fast
14m
arrays and dynamic arrays from scratch
13m
strings: immutability, builders, and the hidden o(n)
13m
Module quiz
the cost of everything
linear structures and their patterns
0
/4
linked lists: when they actually beat arrays
17m
stacks and queues: the workhorses
16m
two pointers and sliding window
17m
binary search: one template for every variant
19m
Module quiz
linear structures and their patterns
recursion and sorting
0
/3
thinking recursively: the call stack made concrete
14m
comparison sorts: merge, quick, and how libraries sort
21m
divide and conquer
14m
Module quiz
recursion and sorting
hashing and trees
0
/4
hash tables: collisions, load factor, and resizing
17m
binary trees and the four traversals
16m
binary search trees and the degenerate case
16m
heaps, priority queues, and heap sort
17m
Module quiz
hashing and trees
first steps into graphs
0
/2
representing graphs: adjacency list vs matrix
14m
bfs and dfs: the traversal patterns everything builds on
23m
Module quiz
first steps into graphs
certificate
support
feedback
Toggle Sidebar
data structures & algorithms - foundations
linear structures and their patterns: module quiz
Jump to…
K
sign in
Command Palette
Search for a command to run...