AMD Coding Interview Questions
25 AMD coding interview problems with full optimal solutions — 8 easy, 12 medium, 5 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an AMD interviewer values, and a FAQ section.
Showing 2 problems of 25
- #4hardoccasionally asked
4. Median of Two Sorted Arrays
The logarithmic bound is the whole point of this hard: merging two sorted arrays to grab the middle is trivial, so the O(log(m+n)) requirement exists purely to force the partition insight. AMD candidates report it in performance-critical final rounds, where the bisection mindset transfers directly — the same halving logic an engineer uses to isolate a bottleneck in multi-stream profiler data is what narrows the partition search to the correct split.
- #127hardoccasionally asked
127. Word Ladder
Find the shortest transformation sequence from beginWord to endWord, changing one letter at a time. AMD uses BFS shortest-path problems to test graph modeling — the same one-step-change-at-a-time traversal appears in ISA mutation analysis, hardware configuration space search, and register file allocation in compiler backends.