12 curated coding interview questions directly asked in Hubspot technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 277 | Find the Celebrity | Medium | Core DSA | Implementation / Reasoning | 49.0% | 100.0% | 3m |
| 2043 | Simple Bank System | Medium | Core DSA | Implementation / Reasoning | 69.7% | 87.5% | 3m |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 87.5% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 75.0% | all |
| 1297 | Maximum Number of Occurrences of a Substring | Medium | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS | 54.5% | 75.0% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 75.0% | all |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 62.5% | all |
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 62.5% | all |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 50.0% | all |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 50.0% | all |
| 2386 | Find the K-Sum of an Array | Hard | Arrays | Sorting / Prefix / Scan | 41.5% | 50.0% | all |
| 2623 | Memoize | Medium | Core DSA | Implementation / Reasoning | 65.0% | 50.0% | all |