15 curated coding interview questions directly asked in Datadog technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 100.0% | all |
| 819 | Most Common Word | Easy | Strings | Hashing / Sliding Window | 45.1% | 100.0% | all |
| 559 | Maximum Depth of N-ary Tree | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 73.6% | 87.5% | all |
| 408 | Valid Word Abbreviation | Easy | Strings | Hashing / Sliding Window | 37.0% | 87.5% | all |
| 622 | Design Circular Queue | Medium | Stack / Queue; Design | Monotonic Stack / Simulation; Data Structure Design | 54.7% | 87.5% | all |
| 211 | Design Add and Search Words Data Structure | Medium | Strings; Binary Search; Design | Hashing / Sliding Window; Binary Search; Data Structure Design | 48.5% | 87.5% | all |
| 1229 | Meeting Scheduler | Medium | Greedy | Greedy | 55.2% | 87.5% | all |
| 1452 | People Whose List of Favorite Companies Is Not a Subset of Another List | Medium | Linked List | Two Pointers | 60.6% | 75.0% | all |
| 568 | Maximum Vacation Days | Hard | Arrays | Sorting / Prefix / Scan | 46.8% | 62.5% | all |
| 480 | Sliding Window Median | Hard | Heap | Priority Queue; Sliding Window | 39.0% | 62.5% | all |
| 124 | Binary Tree Maximum Path Sum | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 42.3% | 62.5% | all |
| 213 | House Robber II | Medium | Dynamic Programming | State Transition | 44.9% | 62.5% | all |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 62.5% | all |
| 1232 | Check If It Is a Straight Line | Easy | Core DSA | Implementation / Reasoning | 40.1% | 50.0% | all |
| 112 | Path Sum | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 54.9% | 50.0% | all |