Given a boolean 2D matrix where true represents a walkable path and false represents an obstacle, find the minimum number of steps to travel from (0,0) to (i,j). Return -1 if unreachable.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.