BitGo Interview Experience – Backend Engineer E3 (Rejected)

bitgo logo
bitgo
Backend Engineer E3IndiaRejected
November 7, 202538 reads

Summary

I interviewed for a Backend Engineer E3 role at BitGo after recruiter outreach via Instahyre, but unfortunately, I was rejected after the Machine Coding round, despite receiving positive feedback during the interview.

Full Experience

My interview process for the Backend Engineer E3 role at BitGo began with recruiter outreach through Instahyre.

Round 1: Online Assessment (Coderbyte)
This was an online assessment administered via Coderbyte. Honestly, I don't recall the specific questions from this round.

Round 2: DSA Pair Programming (Coderbyte)
This round involved live coding and discussions on two data structures and algorithms problems:
1. A BFS problem on a grid, which was quite similar to the classic Rotting Oranges problem.
2. Finding the longest path in a general graph. This problem was conceptually similar to LeetCode's Binary Tree Maximum Path Sum, but adapted for a graph structure, and I was also required to print the actual path.

Round 3: Machine Coding (LLD)
The task here was to implement the stoi (string to integer conversion) function. While it seemed like a DSA problem, I approached it with a strong focus on low-level design principles. I ensured I followed proper Object-Oriented Design (OOD), covered all relevant edge cases clearly, and completed the implementation in approximately 35 minutes. To demonstrate extensibility, I even incorporated a Strategy Pattern, which would allow for future parsing rules. The interviewer mentioned that all requirements were fulfilled and the round concluded early.

Final Outcome
Despite what seemed like a positive outcome in the LLD round, I was ultimately rejected. No detailed feedback was provided regarding the rejection.

Interview Questions (3)

Q1
BFS on a Grid (Rotting Oranges-like)
Data Structures & Algorithms

A problem requiring the application of Breadth-First Search on a grid, conceptually similar to the 'Rotting Oranges' LeetCode problem.

Q2
Longest Path in a Graph
Data Structures & Algorithms

Find the longest path within a general graph structure. This problem was presented as an extension of the 'Binary Tree Maximum Path Sum' concept to an arbitrary graph. Additionally, I was required to print the identified path.

Q3
Implement String to Integer (stoi)
Data Structures & Algorithms

Implement the stoi (string to integer conversion) function. My approach focused on proper Object-Oriented Design (OOD), comprehensive handling of edge cases, and incorporating extensibility via the Strategy Pattern.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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