bitgo logo
Bitgo· Senior Backend Engineer

BitGo | Senior Backend Engineer | Bangalore | July 2024 ~[Ghosted-> Rejected]

Result
Rejected
Location
Bangalore
Experience
3.5 years
Posted
24 Aug 2024
346 reads

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.

How it went

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.

Questions asked (3)

  1. 01

    Low-Level Design: Snake and Ladder Game

    System Design

    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.

  2. 02

    Maximum Sum of Non-Adjacent Elements in a Tree

    Data Structures & Algorithms

    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.

  3. 03

    Maximum Sum of Non-Adjacent Elements in an Array

    Data Structures & Algorithms

    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.

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!