โ† MakeMyTrip questions

Standard BFS for graph traversal

Filed under MakeMyTrip

Given an undirected graph represented as an adjacency list and a starting node, perform a Breadth-First Search (BFS) to visit all reachable nodes and return the traversal order.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related MakeMyTrip questions

Collected from public candidate posts and coding forums. Updated Nov 2026.