โ OYO questionsMinimum distance in a grid with obstacles
Filed under OYO
Given a grid with '.' (empty), 'B' (blocked), 'S' (source), and 'D' (destination), find the shortest path distance from S to D using 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.
Collected from public candidate posts and coding forums. Updated Nov 2026.