3 curated coding interview questions directly asked in Soundhound technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 1367 | Linked List in Binary Tree | Medium | Trees; Linked List | DFS / BFS; Two Pointers | 52.0% | 100.0% | all |
| 1752 | Check if Array Is Sorted and Rotated | Easy | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 57.3% | 100.0% | all |
| 41 | First Missing Positive | Hard | Arrays | Sorting / Prefix / Scan | 42.9% | 62.5% | all |