Microsoft

ApproachOne pass with a hash map of value → index; for each x, check whether target − x was already seen.

EvaluatesWhether you move from the brute-force O(n²) to a clean O(n) hash-map solution and reason about edge cases.

ApproachIterate with three pointers (prev, curr, next), rewiring links; discuss the recursive variant and its stack cost.

EvaluatesPointer manipulation, in-place mutation, and clarity under a deceptively simple task.

ApproachBuild a directed graph and run topological sort (Kahn/BFS or DFS cycle detection).

EvaluatesRecognizing a cycle-detection problem behind a word problem.

ApproachCompare token bucket vs. sliding window, where state lives (per-node vs. Redis), and behavior under bursts.

EvaluatesAlgorithm choice, distributed state, and failure/consistency trade-offs.

ApproachTrie or prefix index, top-k ranking, caching, and updating suggestions from live traffic.

EvaluatesLatency budget, data-structure choice, and freshness vs. cost.

ApproachUse STAR: the situation, your reasoning, how you disagreed respectfully and reached a decision, and the result.

EvaluatesCommunication, judgment, and whether you can disagree-and-commit without drama.

ApproachPick a real failure, own it without blaming others, and show the concrete lesson you applied later.

EvaluatesSelf-awareness, accountability, and growth.