karn
stack
Search
K
All courses
Data Structures & Algorithms: Foundations
17 lessons · 4h 34m
0/17 done
4h 35m left
Module 1 · 53 min
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
Module 2 · 69 min
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
Module 3 · 49 min
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
Module 4 · 66 min
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
Module 5 · 37 min
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
Certificate
Unlock every course
See plans
Support
Feedback
System status
55a2c5d
Toggle Sidebar
Courses
Data Structures & Algorithms: Foundations
Hashing and trees: module quiz
Jump to…
K
D
Sign in
