Grokking Data Structures & Algorithms for Coding Interviews
The layer below pattern practice: arrays, linked lists, stacks, queues, trees, heaps, graphs and hash tables, each built up from first principles with the complexity analysis that interviewers actually ask about. Start here if pattern courses feel like they are moving too fast.
Course
Interview Prep
Design Gurus
4 to 6 weeks
Beginner
Subscription
What it covers
Every core structure, in the order they build on each other. Arrays and strings, then linked lists, stacks and queues, then the tree family, heaps, tries, graphs and hash tables. Each one gets its operations, its time and space costs, and the situations where choosing it is the whole answer to a question.
Why it matters
A surprising number of failed interviews are not pattern failures. They are moments where a candidate reaches for a list when they needed a heap, or cannot say why a hash lookup is constant time on average but not in the worst case. Interviewers probe that, and no amount of problem grinding covers for it.
How to use it
Treat this as prerequisite reading rather than interview prep. Work through it once properly, implementing each structure yourself in your main language rather than reading the implementation, then move on to pattern work. If you already know this material cold, skip it.
Best for: students, career switchers, and anyone whose computer science foundation came from tutorials rather than a curriculum.
Ready to start?
Opens on Design Gurus in a new tab.
Stuck on something specific?
Writing only gets you so far. If you want an answer to your situation rather than the general case, book a session and we will work through it together. Every session is free; a few slots open each week.
Follow along
New writing, resources and project ideas land here first.