All challenges
Multiple ChoiceIntermediate 180s

[Algorithms] Shortest path Level-order graph traversal

Unweighted graph BFS finds shortest.
Options
  1. 1Binary search
  2. 2BFS
  3. 3Quicksort
  4. 4Dynamic programming

Think you can answer under pressure?

Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.

Play this in a 3-minute battle