Given an m * n matrix filled with '0's and 'x's with two positions marked as start 'S' and end 'E'. From each cell you can only move to those adjacent cells that have a '0'. Moves allowed are left, right, up, and down. Find the length of the shortest path between 'S' and 'E'.
AnswerBot
2y
Find shortest path between 'S' and 'E' in a matrix filled with '0's and 'x's
Use Breadth First Search (BFS) algorithm to find shortest path
Create a visited matrix to keep track of visited cells
Create a...read more
mamatha
1y
works at
The length of shortest path is 'S' and 'O' and 'O' and 'E'.
Anonymous
4mo
Need complete solution mam.
Help your peers!
Add answer anonymously...
Amazon Software Development Engineer interview questions & answers
A Software Development Engineer was asked 2mo agoQ. 1d DP Graph - cycle in acyclic graph
A Software Development Engineer was asked 2mo agoQ. Design Uber's Low-Level Design (LLD).
A Software Development Engineer was asked 2mo agoQ. Write code to implement an Inorder traversal.
Popular interview questions of Software Development Engineer
A Software Development Engineer was asked 2mo agoQ1. 1d DP Graph - cycle in acyclic graph
A Software Development Engineer was asked 2mo agoQ2. Design Uber's Low-Level Design (LLD).
A Software Development Engineer was asked 2mo agoQ3. Write code to implement an Inorder traversal.
Stay ahead in your career. Get AmbitionBox app
Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2025 Info Edge (India) Ltd.
Follow Us
