17 curated coding interview questions directly asked in Amd technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 12 | Integer to Roman | Medium | Strings | Hashing / Sliding Window | 71.0% | 100.0% | 6m |
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 100.0% | 6m |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 100.0% | all |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 100.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 100.0% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 87.5% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 87.5% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 87.5% | all |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 87.5% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 75.0% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 75.0% | all |
| 9 | Palindrome Number | Easy | Strings | Hashing / Sliding Window | 60.6% | 75.0% | all |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 75.0% | all |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 75.0% | all |
| 234 | Palindrome Linked List | Easy | Strings; Linked List | Hashing / Sliding Window; Two Pointers | 58.0% | 75.0% | all |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 75.0% | all |
| 876 | Middle of the Linked List | Easy | Linked List | Two Pointers | 81.8% | 75.0% | all |