BitGo | SSE | Bangalore | [Rejected]
Summary
I had an interview at BitGo for an SSE role in Bangalore, which resulted in rejection. During the first round, I was asked to find the shortest path between two nodes in a graph, which I was unable to solve.
Full Experience
Round 1: Data Structures & Problem Solving
Question : Return the shortest distance from A -> F Input : {"5","A","B","C","D","F","A-B","A-C","B-C","C-D","D-F"} Ouput : Shortest path from A to F: A -> C -> D -> F
I haven't practiced shortest distance problems, so I wasn't able to explain the correct approach for this one.
Interview Questions (1)
Shortest Distance in Graph
Return the shortest distance from A -> F Input : {"5","A","B","C","D","F","A-B","A-C","B-C","C-D","D-F"} Ouput : Shortest path from A to F: A -> C -> D -> F
Preparation Tips
I haven't practiced shortest distance problems, so I wasn't able to explain the correct approach for this one.