โ Adobe questionsPath and minimum moves in a grid with obstacles
Filed under Adobe
Given an N x N grid with source (1), destination (2), blank cells (3), and walls (0), find if a path exists and return the minimum moves 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.