BitGo
Custody-focused loops where security reasoning matters as much as code — key management, threat modeling, and distributed systems.
Typical loop
- 1Recruiter screen
- 2Technical phone screen
- 3Onsite: coding and security-reasoning rounds
- 4Architecture round on custody and key management
- 5Behavioral round
Questions
Callback's practice questions and the LeetCode questions BitGo has been asking, filtered together.
Asked on LeetCode
15 questions · all time
- Check if an Original String Exists Given Two Encoded StringshardStringDynamic Programmingfrequency 100.0
- Gas StationmediumArrayGreedyfrequency 96.8
- Number of IslandsmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 88.8
- LRU CachemediumHash TableLinked ListDesignDoubly-Linked Listfrequency 83.5
- Bus RouteshardArrayHash TableBreadth-First Searchfrequency 76.7
- Longest Palindromic SubstringmediumTwo PointersStringDynamic ProgrammingManacherfrequency 76.7
- Course SchedulemediumDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort+1frequency 67.0
- Largest Rectangle in HistogramhardArrayStackMonotonic StackRange Minimum/Maximum Queryfrequency 67.0
- Longest Consecutive SequencemediumArrayHash TableUnion-Findfrequency 67.0
- Longest Substring Without Repeating CharactersmediumHash TableStringSliding Windowfrequency 67.0
- Longest Substring with At Most K Distinct CharactersmediumHash TableStringSliding Windowfrequency 67.0
- Lowest Common Ancestor of a Binary TreemediumTreeDepth-First SearchBinary TreeBinary Lifting+1frequency 67.0
- Subarray Sum Equals KmediumArrayHash TablePrefix Sumfrequency 67.0
- Trapping Rain WaterhardArrayTwo PointersDynamic ProgrammingStack+1frequency 67.0
- Vertical Order Traversal of a Binary TreehardHash TableTreeDepth-First SearchBreadth-First Search+2frequency 67.0