Grokking Algorithm Complexity and Big-O
Complexity analysis explained properly, including the amortised and space cases that trip people up under pressure. Short, and it removes a category of interview mistake entirely.
Course
Interview Prep
Design Gurus
1 week
Beginner
Subscription
The gap it fills
Most engineers can say that a nested loop is quadratic and stop there. Interviews go further: the amortised cost of a dynamic array push, why hash table lookup is constant on average and linear in the worst case, the space cost of a recursive call stack, and how to reason about complexity when two different inputs both matter.
What it covers
Asymptotic notation without the unnecessary formality, the common complexity classes with real examples, recursion and the call stack, amortised analysis, and the space side that candidates routinely forget to mention.
How to use it
A week, at most. Then make it a habit: after every practice problem, state the time and space complexity out loud before you look at the solution. That habit is the actual deliverable.
Best for: self taught engineers, and anyone who has ever been asked "and what is the space complexity" and paused too long.
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.