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. part 1 of 3.
17 lessons|5 modules|4.5 hours
what you’ll learn
- reason about big-o, amortized cost, and why the memory hierarchy makes arrays fast
- build every core structure from scratch: dynamic arrays, hash tables, trees, heaps
- reach for two pointers, sliding window, and binary search without thinking
- implement merge, quick, and heap sort and know which one a real library reaches for
- traverse graphs with bfs and dfs, the patterns everything in part 2 builds on
curriculum
01
02
module two
linear structures and their patterns
43 min4 lessons03
module three
recursion and sorting
33 min3 lessons04
frequently asked
- 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, equivalent) and we'll work something out.
- is there a refund?
- yes. 7 days, no questions, mail@karnstack.com.
how this course is 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.