15 curated coding interview questions directly asked in Bitgo technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2060 | Check if an Original String Exists Given Two Encoded Strings | Hard | Strings | Hashing / Sliding Window | 43.4% | 100.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 87.5% | all |
| 134 | Gas Station | Medium | Greedy | Greedy | 48.0% | 87.5% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 87.5% | all |
| 815 | Bus Routes | Hard | Core DSA | Implementation / Reasoning | 47.3% | 75.0% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 75.0% | all |
| 340 | Longest Substring with At Most K Distinct Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 50.0% | 62.5% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 62.5% | all |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | Trees | DFS / BFS | 69.3% | 62.5% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 62.5% | all |
| 84 | Largest Rectangle in Histogram | Hard | Core DSA | Implementation / Reasoning | 49.9% | 62.5% | all |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 62.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 62.5% | all |
| 987 | Vertical Order Traversal of a Binary Tree | Hard | Trees | DFS / BFS | 53.8% | 62.5% | all |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 62.5% | all |