← MakeMyTrip questions

Path finding in binary matrix with hurdles

Filed under MakeMyTrip

Given a binary matrix with 0s (hurdles/blocked) and 1s (open paths), find a valid path from the top-left corner to the bottom-right corner using backtracking.

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

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