BitGo interview questions¶
The most frequent LeetCode problems tagged to BitGo. This is a data-only page. For process and behavioral prep, use the coding guide and behavioral guide.
Based on 0 distinct problems tagged to BitGo in the last 6 months (0 in the last 30 days, 0 in the last 3 months, 15 all-time) across two open datasets of LeetCode company tags. Tags are user-reported, so treat frequency as a signal, not a promise.
Most frequent problems¶
Ranked by frequency, weighted toward the last 30 days. Classics like Two Sum sit near the top of almost every company's list because users tag them everywhere. Solve those fast. The signature list below is more specific to this company.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Check if an Original String Exists Given Two Encoded Strings | Hard | Older | String, Dynamic Programming |
| 2 | Gas Station | Medium | Older | Array, Greedy |
| 3 | Number of Islands | Medium | Older | Array, Depth-First Search, Breadth-First Search, Union-Find |
| 4 | LRU Cache | Medium | Older | Hash Table, Linked List, Design, Doubly-Linked List |
| 5 | Bus Routes | Hard | Older | Array, Hash Table, Breadth-First Search |
| 6 | Longest Palindromic Substring | Medium | Older | Two Pointers, String, Dynamic Programming, Manacher |
| 7 | Course Schedule | Medium | Older | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort |
| 8 | Largest Rectangle in Histogram | Hard | Older | Array, Stack, Monotonic Stack, Range Minimum/Maximum Query |
| 9 | Longest Consecutive Sequence | Medium | Older | Array, Hash Table, Union-Find |
| 10 | Longest Substring Without Repeating Characters | Medium | Older | Hash Table, String, Sliding Window |
| 11 | Longest Substring with At Most K Distinct Characters | Medium | Older | Hash Table, String, Sliding Window |
| 12 | Lowest Common Ancestor of a Binary Tree | Medium | Older | Tree, Depth-First Search, Binary Tree, Binary Lifting |
| 13 | Subarray Sum Equals K | Medium | Older | Array, Hash Table, Prefix Sum |
| 14 | Trapping Rain Water | Hard | Older | Array, Two Pointers, Dynamic Programming, Stack |
| 15 | Vertical Order Traversal of a Binary Tree | Hard | Older | Hash Table, Tree, Depth-First Search, Breadth-First Search |
Sources¶
- liquidslr/leetcode-company-wise-problems and snehasishroy/leetcode-companywise-interview-questions, merged by scripts/build_question_data.py.
Next: More companies