Interview Handbook
Interview preparation for technology geeks

Walk into the loop knowing exactly what comes next.

Clear walkthroughs for coding rounds, system design, CS fundamentals, AI and ML. Everything you need to prepare, in one handbook.

two_sum.py
# One pass, O(n) time, O(n) space
def two_sum(nums, target):
    seen = {}
    for i, n in enumerate(nums):
        need = target - n
        if need in seen:
            return [seen[need], i]
        seen[n] = i
Why a hash map beats nested loops, and how to say it out loud.
Latest posts

Fresh from the blog

All posts
Study roadmap

A simple order to follow

01

Learn the patterns

Two pointers, BFS/DFS, heaps, DP. Patterns beat memorising problems.

02

Practise out loud

Talk through your approach, complexity and edge cases as you code.

03

Add system design

Use one framework on several classic designs until it feels natural.

04

Mock and review

Run timed mocks, then write down what slipped and fix that first.

One problem, one design, one concept. Every week.

A short email you can finish over coffee. Unsubscribe any time.