← OYO questions

Shortest path from source to destination in an N x N maze

Filed under OYO

Given an N x N grid where 0 represents an open path and 1 represents a blocked cell, find the length of the shortest path (minimum number of edges) from a source coordinate (sr, sc) to a destination…

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

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