Theory Card 061 — Algorithm Selection / Breakdown
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 Breakdown stage of BASIC, the goal is to decompose the prompt into named parts. 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, Breakdown is where the candidate should ask: What exactly is the problem asking, what are the constraints, and what is the shape of the input and output? 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 split the problem before trying to solve it. 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 prevents premature solutioning and keeps working memory from being flooded too early.
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 Breakdown step and explain how Algorithm Selection changes the way you would handle the prompt.”