
What to Do Before a Coding Interview: Stop Studying
The 3 hours before your coding interview aren't a study window. Here's the exact routine to prime performance without spiking your cortisol.
Page 59 of 61 · Ideas for curious minds in tech.
Back to the archive
The 3 hours before your coding interview aren't a study window. Here's the exact routine to prime performance without spiking your cortisol.

What to do the night before a coding interview: light review, logistics checklist, anxiety reframing, and why sleep beats one more LeetCode rep.

Three days before your coding interview, stop adding new material. Here's exactly how to consolidate, practice, and sleep your way to peak performance.

A one week coding interview prep plan built around a cold diagnostic audit, not blind grinding. Covers patterns, scheduling, mocks, and failure modes.

CS fundamentals for software engineers: the ceiling fast shippers hit, why leaky abstractions break you, and when the foundation finally pays off.

Big tech vs startup interview: why each process tests completely different signals, what they're really filtering for, and which path to prepare for.

Five DSA algorithms you study are already running in production: Dijkstra in Google Maps, Huffman in JPEG, topological sort in PyTorch, and more.

Coding interview practice builds six engineering habits that follow you into production debugging, code review, and design decisions for your entire career.

Competitive programming trains the wrong interview skills. Learn why CP habits hurt coding interviews and what actually prepares you for the offer.

How to debug in a coding interview systematically: trace tables, off-by-one errors, mutation bugs, and a one-fix-at-a-time loop that works under pressure.

AI didn't make the coding interview obsolete. It made it harder. Why Google, Meta, and Canva all raised the ai coding interview bar in 2026.

The Amazon Bar Raiser interview explained: what they assess, how the 50% rule works, and how to prep your STAR stories to survive 5 layers of follow-up.

How software engineer interview levels change the bar from L3 to Staff. Same problem, different rubric. Here's what gets you hired at each level.

Master the two pointer technique: converging and fast-slow variants explained with proofs, worked examples for LeetCode 11, 15, and 167.

The best language for coding interviews is the one you already know. Here's where Python, Java, C++, JavaScript, and Go actually differ.

When you've seen a coding interview problem before, skipping the process still costs you the offer. Here's exactly how to handle familiar questions.

Iterative postorder traversal: O(n) two-stack trick vs O(h) single-stack with lastVisited. Traces, complexity analysis, and 14 language implementations.

Iterative inorder traversal explained: stack algorithm, O(h) space proof, BST iterator, Morris traversal, and implementations in 14 languages.

Build a strict O(1) LFU cache implementation using a HashMap, doubly linked lists, and one minFreq integer. 14 language examples included.

Learn iterative preorder traversal step by step. Push order, O(h) space proof, and 14 language implementations with coding interview tips.

The Boyer-Moore voting algorithm finds a majority element in O(n) time and O(1) space. Proof, 14 language implementations, and LeetCode 169 and 229 explained.

Floyd's Phase 2 finds the cycle start in a linked list in O(n) and O(1) space. Proof, 14-language implementations, LeetCode 142 and 287 solved.

Floyd's tortoise and hare cycle detection in O(n) time and O(1) space. Full proof of the closing-gap argument, 14 language implementations, and the LeetCode cycle patterns (141, 202, 287) it solves.

How Dijkstra's algorithm finds shortest paths on weighted graphs, why it fails with negative weights, and clean implementations in 14 languages.