← Accenture questions
CodingHard

Shortest path in a maze using BFS

Filed under Accenture · Also reported at Junglee Games

Write a program to find the length of the shortest path from a start point to an end point in a 2D grid maze using breadth-first search (BFS).

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 Accenture questions

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