BitGo | Senior Backend Engineer | Bangalore | July 2024 ~[Ghosted-> Rejected]
Summary
I interviewed for a Senior Backend Engineer position at BitGo in Bangalore. The process included an LLD round focused on the Snake and Ladder game and a DSA round involving dynamic programming problems. Despite positive feedback on my performance, I was ultimately rejected.
Full Experience
I applied for the Senior Backend Engineer role at BitGo in Bangalore, coming from an SDE-2 position at a Japan-based Fintech company with 3.5 years of experience. My current compensation was ₹24,82,000 INR per annum.
First Round | June 2024 (Low-Level Design)
For the first round, the interviewer presented me with a challenge to implement a Snake and Ladder game, along with several bonus improvements tailored for a senior-level engineer. I focused on designing a robust and extensible system, and I successfully cleared this round.
Second Round | July 2024 (Data Structures and Algorithms)
In the second round, I faced two challenging DSA questions. The first asked me to find the maximum sum of non-adjacent elements within a tree, and the second was a similar problem but for an array. I was able to articulate and implement solutions for both problems, achieving linear time complexity for each. While I felt I performed well and the interviewer expressed satisfaction with my approach, I suspected there might have been room for even further optimization. Following this round, I experienced a period of being ghosted by HR. Eventually, I received a call informing me that I did not perform well enough, though I suspect the position might have been filled in the interim. I had initially discussed a compensation expectation of ~32 LPA, which HR seemed ready to offer.
Outcome
Despite my best efforts and what seemed like a positive interview experience, I was unfortunately rejected.
Interview Questions (3)
Low-Level Design: Snake and Ladder Game
Design and implement a Snake and Ladder game. The problem required incorporating several bonus improvements suitable for a senior-level engineering role, focusing on low-level design principles.
Maximum Sum of Non-Adjacent Elements in a Tree
Given a tree, find the maximum sum of elements such that no two selected elements are adjacent (i.e., directly connected by an edge). I was expected to provide the best approach, aiming for linear time complexity.
Maximum Sum of Non-Adjacent Elements in an Array
Given an array of integers, find the maximum sum of elements such that no two selected elements are adjacent. I was expected to provide the best approach, aiming for linear time complexity.