Software Development Engineer 2
Print All Shortest Paths in an Undirected Graph
Write a function that prints all shortest paths between a given source and destination node in an undirected graph. Use a suitable algorithm to ensure correct shortest path determination.
This question was asked in
Flipkart Software Development Engineer 2 Interview Experience
The Flipkart interview process for the Backend Software Development Engineer 2 included four rounds, primarily focused on Data Structures and Algorithms, followed by Low-Level and High-Level Design questions. Candidates faced questions about pathfinding in graphs and string manipulation, as well as system design tasks involving inventory management and translation applications. Overall, the interview was quite challenging, requiring a solid grip on various technical skills, particularly in backend development.