Find shortest path to reach from one point to another in a 2d matrix. Link - -----/
AnswerBot
1y
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...
Top Amazon Software Development Engineer interview questions & answers
Popular interview questions of Software Development Engineer
Top HR questions asked in Amazon Software Development Engineer
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
Follow us
