Bitgo DSA round

bitgo logo
bitgo
SDE II3.5 years
June 19, 20258 reads

Summary

I went through a DSA round at Bitgo for an SDE2 role, which included a pre-screening with two easy coding questions and a main round where I successfully solved the Longest Increasing Path in a Matrix problem within 30 minutes. Despite the positive interview feedback, I was unexpectedly rejected.

Full Experience

YOE: 3.5 years

Role: SDE2

Pre 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 stuck.

Waiting for results of first round, Will update in case next set of rounds happen.

Update on the results : ( Very unexpectedly they rejected me, even after i solved the question, and interviewer was satisfied with the implementation and approach. I solved, submitted, and optimized it in 30 minutes itself)

Interview Questions (1)

Q1
Longest Increasing Path in a Matrix
Data Structures & Algorithms

Given an m x n integers matrix, return the length of the longest increasing path in the matrix. From each cell, you can either move in four directions: left, right, up, or down. You may not move diagonally or move outside the boundary.

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!