Algorithmic Problem-Solving and Data Structure Selection Questions

The higher-order meta-skill of attacking an unfamiliar problem: recognizing problem archetypes and mapping them to known techniques, decomposing under constraints, and choosing, composing, or designing the right data structures to meet specified operation costs (LRU cache, min-stack, ordered maps, disjoint-set/union-find). Covers reasoning about trade-offs between competing structures and approaches, working through medium-to-hard problems methodically, handling problem variations, and communicating an approach before coding. The connective-tissue topic that ties the individual structure and algorithm topics together, rather than any single structure or algorithm.

MediumTechnical
37 practiced

You have k sorted sequences (log streams, sorted linked lists, or sorted files too large to fit in memory together) and need to merge them into one sorted output under limited memory. Implement the merge and explain why a heap keyed on 'next element per source' beats repeatedly scanning all k sources for the minimum.

MediumTechnical
43 practiced

You need the shortest path in a weighted graph. Walk through how you would choose between BFS, Dijkstra, Bellman-Ford, and A*, based on whether edges are weighted, whether negative weights are possible, and whether you need single-source or all-pairs distances. When would A*'s heuristic actually help over plain Dijkstra, and what property must that heuristic have?

MediumTechnical
42 practiced

Implement a prefix-tree structure that supports insert(word), search(word), and startsWith(prefix). Then explain why this beats a plain hash set of words when the workload is dominated by prefix queries rather than exact-match lookups.

MediumTechnical
40 practiced

You are given a list of courses and prerequisite pairs: to take course A you must first take course B. Determine whether it is possible to finish all courses, and if so, produce one valid order to take them in. What should your algorithm do if the prerequisites contain a cycle?

MediumTechnical
40 practiced

Rotate an array to the right by k steps in-place, using O(1) extra space (k may exceed the array's length). Explain your approach, and how the same in-place three-reversal trick generalizes: reversing a string in place, or rotating a 2D matrix in place.

Unlock Full Question Bank

Get access to all Algorithmic Problem-Solving and Data Structure Selection interview questions and detailed answers.

Sign in to Continue

Join thousands of developers preparing for their dream job.