Cheapest Flights Within K Stops is a problem that looks like a routine shortest-path question, but it quietly adds a twist that breaks the standard tool. The signal interviewers want is whether you can recognize when a familiar algorithm's assumptions are violated and reach for the right variant instead of forcing the wrong tool.

Alien Dictionary is one of the hardest "medium" problems in the interview rotation, and it earns that reputation by hiding a clean graph problem behind a deceptive premise. The instinct is to think about sorting or string comparison — but those are dead ends. The real insight is that the sorted order of the words is a set of ordering constraints between letters, and recovering the alphabet means assembling those constraints into a consistent sequence: a topological sort.

Reconstruct Itinerary is a problem that looks like a routine graph traversal and turns out to be a subtle trap for the obvious approach. The setup practically begs for backtracking. That works, but it's exponential, and the candidates who reach for it spend their time wrestling with backtracking bookkeeping instead of seeing the structure. The candidates who recognize "use every edge exactly once" as the definition of an Eulerian path unlock a clean, near-linear algorithm.

Network Delay Time is the problem interviewers use to find out whether you understand why Dijkstra's algorithm exists, not just how to type it out. The candidates who understand that unequal edge weights invalidate BFS's core assumption know to reach for Dijkstra instead. The signal here is whether you can tell weighted shortest path from unweighted shortest path, and whether you know why the distinction forces a different algorithm.

Minimum Height Trees is a problem that punishes the obvious approach and rewards stepping back to find structure. The naive reading — "try every node as the root, measure the height, keep the best" — works, but it's quadratic, and the interviewer is specifically watching to see whether you settle for that or push for the insight that makes it linear. The key realization is that this isn't really a "measure heights" problem at all; it's a "find the center of the tree" problem

Word Ladder is a shortest-path problem wearing a string-manipulation costume, and the entire challenge is seeing through the disguise. The problem talks about transforming words one letter at a time, which sounds like it might call for clever string algorithms or backtracking. But the moment you reframe words as nodes and one-letter transformations as edges, it becomes a textbook shortest-path-in-an-unweighted-graph problem.

Course Schedule II is the natural sequel to Course Schedule, and interviewers often pose it as a follow-up after you've solved the feasibility version. The shift is small to state but significant in practice: instead of asking whether all courses can be finished, it asks you to produce a valid order to finish them.

Number of Islands is a common interview problem because it tests a specific cognitive move: can you recognize that a problem presented in one form is actually a different problem in disguise? The 2D grid framing is intuitive — humans naturally think of grids as visual things — but the underlying problem is counting connected components in a graph. The signal here is whether you can map between representations — see past the surface presentation to the underlying structure.

Wildcard Matching is a problem interviewers reach for when they want to see whether you can interpret pattern semantics carefully and resist the urge to write greedy code. The actual skill being tested is the discipline to model the operator's semantics precisely before reaching for a familiar template.

Regular Expression Matching is one of the hardest "easy-to-explain" dynamic programming problems in the standard interview rotation. The problem statement fits in three sentences, but the implementation rewards a very specific kind of thinking: can you take a vague, recursive-feeling specification and turn it into a precise DP table with rigorously-defined transitions?

Russian Doll Envelopes is a dynamic programming problem that interviewers love because it tests whether you can recognize a familiar problem hiding inside an unfamiliar one. The challenge is in realizing that with the right sort, the second dimension collapses into a classic Longest Increasing Subsequence problem. That recognition is the actual signal the interviewer is looking for.

Interviewers reach for the Burst Balloons dynamic programming problem because it tests a specific mental move: when forward reasoning fails, can you flip the question and reason backward? Candidates pass when they can make that flip and then define a clean interval state; candidates who can't do that tend to spiral.

Edit Distance is one of the cleanest tests an interviewer has for whether you can reason about multi-dimensional state and justify transitions from first principles, rather than pattern-match to a memorized template. The technique you build here - defining state over prefixes and anchoring decisions at a boundary - is the same one that unlocks Longest Common Subsequence, Regular Expression Matching, and most other two-string DP problems you'll encounter.

Learn how to solve the Longest Increasing Subsequence coding problem to prepare for your next technical interview! Longest Increasing Subsequence sounds like a greedy problem. Just keep taking bigger numbers, right? That instinct fails fast. This problem exists to test whether you can slow down, recognize why greedy breaks, define state correctly, and build up a solution from first principles.

Learn how to solve the Palindrome Partitioning coding problem to prepare for your next technical interview! Palindrome Partitioning is a backtracking problem that tests whether you can explore a decision tree methodically while pruning invalid paths early.

Learn how to solve the Sudoku Solver coding problem to prepare for your next technical interview! Sudoku Solver looks overwhelming because the board is big and the rules feel strict. That's exactly why interviewers like it. It tests whether you can manage many constraints simultaneously while still writing clean, controlled backtracking code.

Learn how to solve the Combination Sum II problem to prepare for your next technical interview! Combination Sum II has the same goal as Combination Sum, with one crucial difference. Each number can only be used once, and the input may contain duplicates. That single change forces you to be much more deliberate about how you explore the search space. Get the duplicate handling wrong and you'll produce repeated combinations. Get it too aggressive and you'll miss valid ones.

Learn how to solve the Word Break coding problem to prepare for your next technical interview! Interviewers love Word Break because it exposes whether you can translate a vague problem statement into a clean DP state definition. The algorithm itself isn't complicated. The hard part is seeing the problem the right way.

Learn how to solve the Unique Paths II coding problem to prepare for your next technical interview! Unique Paths II looks almost identical to Unique Paths. One small change: obstacles. That single twist forces you to slow down, re-examine every assumption, and adapt the same DP pattern carefully. Interviewers love this problem precisely because it separates candidates who understand the pattern from those who just memorized it.

Learn how to solve the Climbing Stairs coding problem to prepare for your next technical interview!