There exists a 3x3 matrix, start from the first element reach the last element of the matrix, between each edges there exists a weight. Reach the destination such that the sum of weights should be small. It was an indirect question on graphs.
AnswerBot
1y
The question is about finding the shortest path in a 3x3 matrix with weighted edges.
This is a graph traversal problem.
Use a graph algorithm like Dijkstra's algorithm or A* search to find the shortest ...read more
Help your peers!
Add answer anonymously...
Top PayPal Software Engineer Level 1 interview questions & answers
Popular interview questions of Software Engineer Level 1
Top HR questions asked in PayPal Software Engineer Level 1
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
