How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent BitGo interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Problem database last updated: June 20, 2025
9 problems · 0 Easy, 6 Medium, 3 Hard · Ranked #165 of 458
0 Easy
0% · avg 23%
6 Medium
67% · avg 59%
3 Hard
33% · avg 18%
Based on 9 reported problems, BitGo interviews are significantly harder than average - 33% Hard vs 18% across all companies. The majority (67%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, BitGo puts unusual emphasis on breadth-first-search (22.2% of problems, 2.7x the industry average), matrix (22.2% of problems, 2.5x the industry average), depth-first-search (22.2% of problems, 2.4x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (55.6%), string (22.2%), dynamic-programming (22.2%), depth-first-search (22.2%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Check if an Original String Exists Given Two Encoded Strings An original string, consisting of lowercase English letters, can be encoded by the following steps: | Hard | Very Likely | stringdynamic-programming | Solve |
Gas Station There are n gas stations along a circular route, where the amount of gas at the ith station is gas[i]. | Medium | Very Likely | arraygreedy | Solve |
Number of Islands Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. | Medium | Very Likely | arraydepth-first-searchbreadth-first-search | Solve |
Bus Routes You are given an array routes representing bus routes where routes[i] is a bus route that the ith bus repeats forever. | Hard | Likely | arrayhash-tablebreadth-first-search | Solve |
Zigzag Conversion The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better... | Medium | Likely | string | Solve |
LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. | Medium | Likely | hash-tablelinked-listdesign | Solve |
Lowest Common Ancestor of a Binary Tree Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. | Medium | Likely | treedepth-first-searchbinary-tree | Solve |
Game of Life According to Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway... | Medium | Likely | arraymatrixsimulation | Solve |
Trapping Rain Water Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. | Hard | Likely | arraytwo-pointersdynamic-programming | Solve |
Check if an Original String Exists Given Two Encoded Strings
SolveAn original string, consisting of lowercase English letters, can be encoded by the following steps:
Gas Station
SolveThere are n gas stations along a circular route, where the amount of gas at the ith station is gas[i].
Number of Islands
SolveGiven an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.
Bus Routes
SolveYou are given an array routes representing bus routes where routes[i] is a bus route that the ith bus repeats forever.
Zigzag Conversion
SolveThe string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better...
LRU Cache
SolveDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache.
Lowest Common Ancestor of a Binary Tree
SolveGiven a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
Game of Life
SolveAccording to Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway...
Trapping Rain Water
SolveGiven n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent BitGo interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
BitGo interviews focus heavily on array, string, dynamic-programming problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. BitGo interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
BitGo has been reported to ask 9 distinct coding problems. The most common topics are array, string, dynamic-programming. 0 are Easy difficulty, 6 are Medium, and 3 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 9 reported problems, BitGo interviews are significantly harder than average - 33% Hard vs 18% across all companies. 67% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, dynamic-programming. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real BitGo coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a BitGo interview with AIarrow_forward