Given a 2D matrix, find the shortest path to reach from one point to another.
AnswerBot
2y
Shortest path in 2D matrix
Use BFS or Dijkstra's algorithm
Create a visited matrix to avoid revisiting cells
Keep track of distance and path
Consider obstacles or blocked cells
Anonymous
4y
My solution was O(n) in time but was taking extra space that could be avoided. I soon realised my mistake but as it was asked in written test so couldn't make further changes as time got utilised.
Help your peers!
Add answer anonymously...
Amazon Software Development Engineer interview questions & answers
A Software Development Engineer was asked 3mo agoQ. 1d DP Graph - cycle in acyclic graph
A Software Development Engineer was asked 3mo agoQ. Design Uber's Low-Level Design (LLD).
A Software Development Engineer was asked 3mo agoQ. Write code to implement an Inorder traversal.
Popular interview questions of Software Development Engineer
A Software Development Engineer was asked 3mo agoQ1. 1d DP Graph - cycle in acyclic graph
A Software Development Engineer was asked 3mo agoQ2. Design Uber's Low-Level Design (LLD).
A Software Development Engineer was asked 3mo 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
