AMD coding interview
questions, leaked.
11 problems reported across recent AMD interviews. Top patterns: array, hash table, math. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
AMD's interview loop pulls from a small but focused problem set, and 64% of it is medium difficulty. You're looking at 11 problems total, heavily weighted toward arrays (7 appearances) and hash tables (4). Two Sum, Spiral Matrix, 3Sum, and Longest Substring Without Repeating Characters show up most. The good news: no hard problems. The catch: medium difficulty means tight edge cases and tricky implementations. If you blank mid-assessment, StealthCoder runs invisibly and surfaces a working solution in seconds, no proctor visibility.
Top problems at AMD
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Spiral Matrix | MEDIUM | 100.0 | 54% | Array · Matrix · Simulation |
| 02 | Rotate Image | MEDIUM | 100.0 | 78% | Array · Math · Matrix |
| 03 | Number of 1 Bits | EASY | 100.0 | 75% | Divide and Conquer · Bit Manipulation |
| 04 | Two Sum | EASY | 100.0 | 56% | Array · Hash Table |
| 05 | Climbing Stairs | EASY | 87.5 | 54% | Math · Dynamic Programming · Memoization |
| 06 | Longest Substring Without Repeating Characters | MEDIUM | 87.5 | 37% | Hash Table · String · Sliding Window |
| 07 | 3Sum | MEDIUM | 87.5 | 37% | Array · Two Pointers · Sorting |
| 08 | Kth Largest Element in an Array | MEDIUM | 87.5 | 68% | Array · Divide and Conquer · Sorting |
| 09 | Subarray Sum Equals K | MEDIUM | 87.5 | 45% | Array · Hash Table · Prefix Sum |
| 10 | Roman to Integer | EASY | 87.5 | 65% | Hash Table · Math · String |
| 11 | Merge Intervals | MEDIUM | 87.5 | 49% | Array · Sorting |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual AMD OA. The proctor cannot see it. Screen share cannot detect it. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage.
Get StealthCoder- array7 · 64%
- hash table4 · 36%
- math3 · 27%
- sorting3 · 27%
- matrix2 · 18%
- divide and conquer2 · 18%
- string2 · 18%
- simulation1 · 9%
- bit manipulation1 · 9%
- dynamic programming1 · 9%
Arrays dominate AMD's assessment by a wide margin. Seven of eleven problems touch array manipulation, and half of those also require you to think in 2D space or use sorting as a constraint. Hash tables are your second pillar, appearing in 4 problems and often paired with array work (Two Sum, Subarray Sum Equals K) or string patterns (Longest Substring Without Repeating Characters). Math and sorting each show up 3 times. The median problem is medium difficulty with multiple valid approaches. Spend your first two days drilling Two Sum and 3Sum to internalize the hash-table and two-pointer muscle memory, then move to Spiral Matrix and Rotate Image for spatial reasoning. If you hit a wall on the live assessment and can't recall the simulation logic for Spiral Matrix or the rotation formula, StealthCoder is your silent backup.
Companies with similar patterns
If you prepped for AMD, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass AMD.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage. Works on HackerRank, CodeSignal, CoderPad, and Karat.
AMD interview FAQ
How many array problems should I solve before the AMD interview?+
Drill at least Two Sum, 3Sum, Spiral Matrix, and Rotate Image. Those four cover 90% of the array patterns AMD tests. Merge Intervals is a bonus. Seven of eleven problems involve arrays, so this is non-negotiable prep.
Is hash-table knowledge essential for AMD's assessment?+
Yes. Four problems depend on hash tables, and three of them are medium difficulty. Two Sum and Longest Substring Without Repeating Characters are your foundation. Subarray Sum Equals K forces you to use a hash map creatively. Master the pattern of key-value lookups fast.
What should I study first for AMD?+
Arrays and hash tables, in that order. Arrays appear in 7 problems, hash tables in 4. Sorting and math are secondary. Start with Two Sum to warm up, then hit 3Sum and Spiral Matrix. You'll build pattern recognition that carries into the harder medium problems.
Are bit manipulation and dynamic programming likely to appear?+
Low frequency. Bit manipulation shows up once (Number of 1 Bits), and DP/memoization once (Climbing Stairs). Don't skip them, but don't burn three days on them. Hit them after arrays and hash tables are solid.
Why are there no hard problems in AMD's reported set?+
AMD's assessment stops at medium difficulty. That's an advantage. It means execution and edge-case handling matter more than algorithmic wizardry. You can nail this with clean code and careful testing, not exotic patterns. The hardest part is staying calm when you see seven array variants.