Theory Card 055 — Invariants / Check
Research lens
An invariant is a condition that remains true throughout an algorithm or system process and anchors correct reasoning. In the Check stage of BASIC, the goal is to verify correctness, quality, and risk. That makes this concept especially relevant here, because it shapes how much mental work the candidate is trying to carry at once and what gets made explicit.
Why it matters in SWE interviews
They are crucial in binary search, sliding windows, heaps, queues, and distributed workflows alike. Structure is where invariants become explicit, which makes implementation safer and explanation clearer. In practice, Check is where the candidate should ask: Does the answer actually satisfy the prompt, handle edge cases, and survive scrutiny? That question acts like a cognitive boundary. It protects the answer from turning into an unstructured search.
BASIC move
A strong move here is to review and stress-test before you hand the answer over. For Invariants, that means deliberately naming the important units instead of juggling them implicitly. The interviewer sees cleaner reasoning, and the candidate benefits from creates a verification loop instead of assuming success.
Common miss
The miss is coding pointer moves or state transitions without naming what must remain true after each step. When that happens, the candidate usually feels busy, but the answer is actually becoming less inspectable.
Practice prompt
“While practicing, pause at the Check step and explain how Invariants changes the way you would handle the prompt.”