Interview Experience Analysis for BitGo

Recruiter Outreach: Via Instahyre Role: Backend Engineer E3 Location : India Status: ❌ Rejected Round 1: Online Assessment (Coderbyte) Don't remember questions. Round 2: DSA Pair Programming (Coderbyte) Live coding + discussions: BFS on a grid → Similar to Rotting Oranges Find longest path in a g...

5 years of experience with a year gap due to medical reasons Earlier i have worked with finance and insurance companies 1. OA, two questions from trie and anagram 2. Round 2-> question based on finding diameter of graph given that graph will not have any cycles 2. Round 3-> Design a sql data base ,...

OA 1. Find shorted path between given source and target. 2. Question related to anagramReceived same OA questions as others have received.Round 1 ( DSA )1. Given a transcript of meeting, find top k most talkative person in the meeting- Need to take a proper input format. Have to decide yourself.Use ...

I wanted to share a recent interview experience with BitGo that left me both disappointed and reflective — not because of the result, but because of the process. Interview Rounds OverviewRound 1: Online Assessment- Rotate Array- Count AnagramsRound 2: DSA Round- Next PermutationRound 3: Low-Level De...

Online AssessmentQuestion 1: Find shortest path between given source and target. Input was in the string format. So we need to create a graph first and do BFSQuestion 2: Fibonacci Series. Given array return fibonacci number greater or equal to sum of array elements.Round 1 DSAQuestion: Given a trans...

YOE: 3.5 yearsRole: SDE2Pre Screening round : Two Easy coding questions on Coderbyte.Round 1 : https://leetcode.com/problems/longest-increasing-path-in-a-matrix/solutions/I was able to solve the question in 30 minutes. Interviewer was super friendly and nice, He was helping out whenever you get stuc...

# BIT-GO (Screening Round) Platform: Coderbyte # 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 betw...

Round 1: Data Structures & Problem SolvingQuestion : Return the shortest distance from A -> FInput : {"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 -> FI haven't practiced shortest distance problems, so I wasn't able to explain the correct appro...