INTERVIEW PREPARATION
Interview questions, answered as mechanisms
Practise explaining the mechanism behind each question. Follow the answer to an article or visualiser, then try again in your own words.
Choose a question, answer out loud, then open its explanation.
Data structures and algorithms
- BFS or DFS — which one, and why? BFS vs DFSRead explanation
- What is the time complexity of binary search, and what has to be true for it to hold? Binary searchRead explanation
- Why does insertion order change a binary search tree’s cost? Binary search tree visualiserRead explanation
- When does a hash table stop being O(1)? Hash tables: keys, collisions and lookup costRead explanation
Databases and persistence
- B-tree or LSM-tree — how would you choose? B-Tree vs LSM-TreeRead explanation
- A PostgreSQL query has an index and is not using it. What do you check? Why PostgreSQL is not using your indexRead explanation
- How do you make a payment endpoint safe to retry? Idempotency keys and safe retriesRead explanation