Theory Card 063 — Algorithm Selection / Structure
Research lens
Algorithm selection is not just recognition; it is the ability to map a problem's structure to a suitable solving strategy. In the Structure stage of BASIC, the goal is to externalize a plan, invariant, or architecture. 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
Interview performance often hinges on identifying when a hash map beats sorting, or when BFS beats DFS, or when a queue beats synchronous work. Assess slows selection down just enough to make it rational instead of reflexive. In practice, Structure is where the candidate should ask: What is the sequence, helper structure, invariant, or component map that will carry the solution? 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 make the plan visible before full execution. For Algorithm Selection, that means deliberately naming the important units instead of juggling them implicitly. The interviewer sees cleaner reasoning, and the candidate benefits from reduces hidden-state thinking and makes reasoning inspectable.
Common miss
The miss is forcing the first remembered pattern onto a problem that only superficially resembles it. When that happens, the candidate usually feels busy, but the answer is actually becoming less inspectable.
Practice prompt
“While practicing, pause at the Structure step and explain how Algorithm Selection changes the way you would handle the prompt.”