BitGo | SDE-2 | Recruiter Ghosted
- Posted
- 31 May 2025
Summary
I completed a screening round for an SDE-2 position at BitGo, solving two graph-related shortest path problems, but was ghosted by the recruiter afterwards.
How it went
BIT-GO (Screening Round)
Platform: Coderbyte
Solved Question 1 with 100% Success rate. Solved almots 97% for 2nd question.
Recuirter said, they didn't get any response from Coderbyte side.
Questions asked (2)
- 01
Shortest Path in Unweighted Graph
Data Structures & Algorithms · Medium
Question:1 (Graph)
- find the shortest path between two node
- Input ["number of vertex", "first-node", .... "last_node", "node1-node2", "node2-node3"], example: ["4", "A", "B", "C", "D", "A-B", "B-C", "C-D"]
- You need to find shortest distance between first-node & last-node
- 02
Shortest Path in Weighted Graph
Data Structures & Algorithms · Medium
Question:2 (Graph)
- find the shortest path between two node in a weighted graph
- Input ["number of vertex", "first-node", .... "last_node", "node1|node2|weight", "node2|node3|weight"] example: ["5", "A", "B", "C", "D", "E", "A|B|1", "B|C|2", "C|D|3", "D|E|4"]
- You need to find shortest distance between first-node & last-node