40 questions · from 16 interviews · 3 asked more than once
Bitgo interview questions
Every question candidates reported from their Bitgo interviews, most frequently asked first. Each links to the write-up it came from, so you can see the round and how it went.
Bitgo coding and DSA questions
- 01
Implement LRU Cache
Design and implement an LRU (Least Recently Used) cache that supports the following operations in O(1) time: - get(key): Return the value of the key if it exists in the cache; otherwise, return -1. - put(key, value): Insert or update the value of the key.…
Asked 2 times · From BitGo (Developer) interview experience
- 02
Longest Increasing Path in a Matrix
In the DSA round, I was asked a problem similar to the LeetCode problem 'Longest Increasing Path in a Matrix'.
Hard · Asked 2 times · From Bitgo | E2 (Backend Developer) | Interview Experience
- 03
Shortest Path in Graph via BFS
Given input in string format representing edges, I had to parse the input, build a graph, and then run BFS to find the shortest path between a given source and target.
From BitGo Interview Experience (SDE-1 / Backend) - Rejected :(
- 04
Fibonacci Number Greater Than Array Sum
Given an array, find the first Fibonacci number that is greater than or equal to the sum of all array elements. A follow-up asked me to explain the complexity and discuss alternative approaches.
From BitGo Interview Experience (SDE-1 / Backend) - Rejected :(
- 05
BFS on a Grid (Rotting Oranges-like)
A problem requiring the application of Breadth-First Search on a grid, conceptually similar to the 'Rotting Oranges' LeetCode problem.
From BitGo Interview Experience – Backend Engineer E3 (Rejected)
- 06
Longest Path in a Graph
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.
From BitGo Interview Experience – Backend Engineer E3 (Rejected)
- 07
Implement String to Integer (stoi)
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.
From BitGo Interview Experience – Backend Engineer E3 (Rejected)
- 08
Diameter of an Acyclic Graph
I was asked to find the diameter of a graph, with the specific constraint that the given graph would not contain any cycles.
Medium · From #bitGo SDE2
- 09
- 10
Top K Most Talkative Person in Meeting Transcript
Given a transcript of a meeting, find the top k most talkative people in the meeting. Need to take a proper input format and decide it yourself.
From BitGo E2
- 11
Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
Medium · From BitGo E2
- 12
Rotate Array
The problem involved rotating an array.
From Bitgo Hiring Process | A Big Red Flag 🚩 | Senior Backend Engineer
- 13
Count Anagrams
The problem involved counting anagrams.
From Bitgo Hiring Process | A Big Red Flag 🚩 | Senior Backend Engineer
- 14
Next Permutation
The problem involved finding the next permutation of a given array.
From Bitgo Hiring Process | A Big Red Flag 🚩 | Senior Backend Engineer
- 15
Count Anagram Extra Members
You’re given a single string of space‑separated words. Some words may be exact duplicates, and others may be anagrams of each other. After removing exact duplicates, count how many words are “extra” members of any anagram group. Input: "aa aa odg dog gdo"…
- 16
Rotate and Concatenate Array
Given an array of non‑negative integers arr of length 𝑛 the first element k = arr[0] tells you how many positions to left‑rotate the entire array. After rotating, write out each element in order and parse the concatenated string as one integer. Input arr =…
- 17
Shortest Path between Source and Target
Find shorted path between given source and target. Input was in the string format. So we need to create a graph first and the do BFS
- 18
Fibonacci Number Greater Than or Equal to Array Sum
Fibonacci Series. Given array return fibbonacci number greater or equal to sum of array elements.
- 19
Top K Most Talkative Persons in a Meeting Transcript
Given a transcript of meeting, find top k most talkative person in the meeting. No input format was given, we need to decide this.
- 20
Shortest Path in Unweighted Graph
Question:1 (Graph) find the shortest path between two node Input ["number of vertex", "first-node", .... "lastnode", "node1-node2", "node2-node3"], example: ["4", "A", "B", "C", "D", "A-B", "B-C", "C-D"] You need to find shortest distance between first-node &…
Medium · From BitGo | SDE-2 | Recruiter Ghosted
- 21
Shortest Path in Weighted Graph
Question:2 (Graph) find the shortest path between two node in a weighted graph Input ["number of vertex", "first-node", .... "lastnode", "node1|node2|weight", "node2|node3|weight"] example: ["5", "A", "B", "C", "D", "E", "A|B|1", "B|C|2", "C|D|3", "D|E|4"]…
Medium · From BitGo | SDE-2 | Recruiter Ghosted
- 22
Shortest Distance in Graph
Return the shortest distance from A - F Input : {"5","A","B","C","D","F","A-B","A-C","B-C","C-D","D-F"} Ouput : Shortest path from A to F: A - C - D - F
Medium · From BitGo | SSE | Bangalore | [Rejected]
- 23
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.
From BitGo | Senior Backend Engineer | Bangalore | July 2024 ~[Ghosted-> Rejected]
- 24
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.
From BitGo | Senior Backend Engineer | Bangalore | July 2024 ~[Ghosted-> Rejected]
- 25
Car Trip Capacity Check
A car has a capacity and an array of people onboarding/dropping at a particular time. Find whether the trip can be completed or not, where a trip can only be completed if at any particular time the number of people in the car are not more than the car's…
From Bitgo India | Backend Engineer E3 | Interview experience | Offer
4 more in the Bitgo write-ups.
Bitgo system design questions
- 01
Low-Level Design: Snake and Ladder Game
For the Low-Level Design round, I was asked to implement the classic Snake and Ladder game. This involved designing the core components and logic for the game, including the board, players, dice rolls, and the mechanics of snakes and ladders.
Asked 2 times · From BitGo | Staff Backend Engineer
- 02
Design a Wallet System
Create a high‑level design for a digital wallet system. The design should cover core components, data flow, calculations (e.g., balances, transaction limits), handling of edge cases (such as concurrency, failure recovery), and integration points with external…
- 03
Design Instagram
I was asked to design Instagram in the System Design round. The focus was on two main features: creating and uploading a post, and viewing the feed. A lot of attention was given to viewing feed scalability, optimizations, and trade-offs.
- 04
Design a Simplified MySQL
I was tasked with designing a simplified version of MySQL, with the expectation of delivering working code. The design needed to support core functionalities such as creating databases, creating tables, inserting rows, querying rows, and exhibiting basic…
From BitGo Interview Experience (SDE-1 / Backend) - Rejected :(
- 05
Design a SQL Database (LLD)
In a machine round focused on Low-Level Design, I was tasked with designing a SQL database.
From #bitGo SDE2
- 06
Design a Transaction Indexer System (HLD)
The High-Level Design round required me to design a Transaction Indexer System.
Hard · From #bitGo SDE2
- 07
Design Notification Service
Design a notification service backend application using Express (or any Node.js framework). It should support POST, Get one, Get all with filters. The solution should utilize Factory and Strategy patterns. Data should be saved in memory, no need for…
From BitGo E2
- 08
High-Level Design: Crypto Currency Wallets
Design a system to create and manage multiple cryptocurrency wallets. Requirements include user login, creating wallets for single asset types (e.g., Bitcoin), depositing funds, withdrawing funds, and supporting multiple assets like Bitcoin, ETH, SOL.
From BitGo E2
- 09
Design a Notification Service
Design a Notification Service with the following features: - Create Notification - List Notifications - Update Notification Status - Send Notifications
From Bitgo Hiring Process | A Big Red Flag 🚩 | Senior Backend Engineer
- 10
Design a Digital Wallet for Crypto
Design a digital wallet for cryptocurrency and discuss how to scale it for millions of users.
From Bitgo India | Backend Engineer E3 | Interview experience | Offer
Bitgo other questions
- 01
API Integration and DFS for Paginated Data
Design a mini-project where you have to call some external APIs, fetch all results (in a paginated way), store them in a local cache (e.g., a text file to ensure persistence even after service restart), and then perform a Depth-First Search (DFS) to find the…
From Bitgo India | Backend Engineer E3 | Interview experience | Offer
Bitgo interview questions FAQ
What questions are asked in Bitgo interviews?
Candidates reported 40 distinct questions across 16 Bitgo interviews. 29 coding and DSA questions, 10 system design questions, 1 other questions.
Which Bitgo interview questions are asked most often?
The most repeated are "Implement LRU Cache" (2 times), "Longest Increasing Path in a Matrix" (2 times), "Low-Level Design: Snake and Ladder Game" (2 times).
How difficult are Bitgo interview questions?
Of the questions candidates rated, 0% were easy, 82% medium and 18% hard.