โ† OYO questions

Shortest path in NxN maze

Filed under OYO

Given an N x N grid representing a maze with obstacles (1 for wall, 0 for path), find the minimum number of steps to travel from (0,0) to (N-1, N-1).

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.