Datadog LeetCode Questions
15 questions all-time · 5 easy · 7 medium · 3 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Most Common Word Array, Hash Table, String, Counting | Easy | 100 | 0.5% |
| 2 | Coin Change Array, Dynamic Programming, Breadth-First Search | Medium | 96 | 0.5% |
| 3 | Meeting Scheduler Array, Two Pointers, Sorting | Medium | 92 | 0.6% |
| 4 | Valid Word Abbreviation Two Pointers, String | Easy | 90 | 0.4% |
| 5 | Maximum Depth of N-ary Tree Tree, Depth-First Search, Breadth-First Search | Easy | 84 | 0.7% |
| 6 | Design Add and Search Words Data Structure String, Depth-First Search, Design, Trie | Medium | 84 | 0.5% |
| 7 | Design Circular Queue Array, Linked List, Design, Queue | Medium | 80 | 0.5% |
| 8 | People Whose List of Favorite Companies Is Not a Subset of Another List Array, Hash Table, String | Medium | 72 | 0.6% |
| 9 | House Robber Array, Dynamic Programming | Medium | 68 | 0.5% |
| 10 | Maximum Vacation Days Array, Dynamic Programming, Matrix | Hard | 58 | 0.5% |
| 11 | Sliding Window Median Array, Hash Table, Sliding Window, Heap (Priority Queue) | Hard | 58 | 0.4% |
| 12 | Binary Tree Maximum Path Sum Dynamic Programming, Tree, Depth-First Search, Binary Tree | Hard | 58 | 0.4% |
| 13 | House Robber II Array, Dynamic Programming | Medium | 58 | 0.5% |
| 14 | Check If It Is a Straight Line Array, Math, Geometry | Easy | 49 | 0.4% |
| 15 | Path Sum Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 49 | 0.6% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.