Backend Engineer E3 at BitGo

How it went

What they would tell you

How to prepare

Their background

Round by round

1. 1

   Online Assessment60 min

   First Round online assessment, which included two DSA problems. Unfortunately, I don’t recall the exact problems, but they were similar in difficulty to medium-level array and tree questions

2. 2

   DSA Round60 min

   Live coding on Coderbyte with a discussion component Problem Similar to Walls and Gates or Sum Root to Leaf Numbers Additional requirement: print the paths along with the result Approach

   • Used DFS traversal to explore all paths
   • Kept track of current path and accumulated sum for each recursive call
   • Discussed edge cases like empty grids or trees with a single node The interviewer provided hints for optimization
   • Walls and Gates
   • Sum Root to Leaf Numbers
3. 3

   Machine Coding Round60 min

   The interviewer smiled and said, Let’s start with something simple, implement stoi I also made sure to handle edge cases empty input, invalid characters, negatives, and overflow. After this, the discussion shifted toward Structural Design Patterns, where I confidently explained 3–4 patterns with use cases

   • String to Integer

What came up