Harder problems still hide a known pattern, but the clues are about structure rather than size. Edges with different positive weights mean Dijkstra; equal weights mean BFS; weights of only 0 and 1 mean a deque-based 0-1 BFS. Prerequisites and "an order that respects them" mean topological sort. Connections that only get added, with "are these connected now?" questions, mean union-find.
Counting ways, or finding the best total, over choices that overlap, means dynamic programming: define the state, then the transition. Values that change between range questions mean a Fenwick tree for sums and a segment tree for minimums, maximums or anything that subtraction cannot undo.
For each question, name the clue that picks the pattern and the clue that rules out the closest alternative. That second sentence is what interviewers listen for.
Name the clue that picks the pattern, and the clue that rules out its neighbor.