Given a 2D grid representing a maze or map, solve a modified Breadth-First Search (BFS) traversal adhering to specific custom rules, and write the standard pseudocode for BFS on a general graph.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.