Beyond BFS and DFS: Dijkstra, MST, KMP, Fenwick trees. Read the scenario, pick the right tool.
Each card is a realistic scenario rather than a bare definition, so the work is matching constraints to an algorithm: negative weights, dense versus sparse graphs, offline versus online queries. Answers include the complexity and when the distractors would have been right. Cards are drawn with spaced repetition, so the ones you miss come back sooner and the ones you know back off. Progress is kept in your browser.