bitgo logo
Bitgo· SDE II

BitGo | SSE | Bangalore | [Rejected]

Location
Bangalore
Posted
1 May 2025
293 reads

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.

How it went

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.

Questions asked (1)

  1. 01

    Shortest Distance in Graph

    Data Structures & Algorithms · Medium

    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

How they prepared

I haven't practiced shortest distance problems, so I wasn't able to explain the correct approach for this one.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Bitgo recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!