How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent AMD interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Problem database last updated: June 20, 2025
A
AMD Coding Interview Questions
11 problems · 4 Easy, 7 Medium, 0 Hard · Ranked #130 of 458
Difficulty breakdown
4 Easy
36% · avg 23%
7 Medium
64% · avg 59%
0 Hard
0% · avg 18%
Top topics
array
63.6%
math
27.3%2.2x
hash-table
27.3%
sorting
27.3%1.9x
matrix
18.2%2.1x
divide-and-conquer
18.2%4.4x
Interview profile
Based on 11 reported problems, AMD interviews are easier than average - only 0% Hard compared to 18% across all companies. The majority (64%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, AMD puts unusual emphasis on divide-and-conquer (18.2% of problems, 4.4x the industry average), math (27.3% of problems, 2.2x the industry average), matrix (18.2% of problems, 2.1x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (63.6%), math (27.3%), hash-table (27.3%), sorting (27.3%). Problems below are sorted by frequency, the ones at the top are asked most often.
All 11 problems
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Rotate Image You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise). | Medium | Very Likely | arraymathmatrix | Solve |
Spiral Matrix Given an m x n matrix, return all elements of the matrix in spiral order. | Medium | Very Likely | arraymatrixsimulation | Solve |
Number of 1 Bits Given a positive integer n, write a function that returns the number of set bits in its binary representation (also known as the Hamming weight). | Easy | Very Likely | divide-and-conquerbit-manipulation | Solve |
Two Sum Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. | Easy | Very Likely | arrayhash-map | Solve |
Longest Substring Without Repeating Characters Given a string s, find the length of the longest substring without duplicate characters. | Medium | Very Likely | hash-tablestringsliding-window | Solve |
Merge Intervals Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove... | Medium | Very Likely | arraysorting | Solve |
Climbing Stairs You are climbing a staircase. It takes n steps to reach the top. | Easy | Very Likely | mathdynamic-programmingmemoization | Solve |
Kth Largest Element in an Array Given an integer array nums and an integer k, return the kth largest element in the array. | Medium | Very Likely | arraydivide-and-conquersorting | Solve |
Subarray Sum Equals K Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k. | Medium | Very Likely | arrayhash-tableprefix-sum | Solve |
Roman to Integer Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. | Easy | Very Likely | hash-tablemathstring | Solve |
3Sum Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. | Medium | Very Likely | arraytwo-pointerssorting | Solve |
Rotate Image
SolveYou are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise).
MediumVery Likely
arraymathmatrix
Spiral Matrix
SolveGiven an m x n matrix, return all elements of the matrix in spiral order.
MediumVery Likely
arraymatrixsimulation
Number of 1 Bits
SolveGiven a positive integer n, write a function that returns the number of set bits in its binary representation (also known as the Hamming weight).
EasyVery Likely
divide-and-conquerbit-manipulation
Two Sum
SolveGiven an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
EasyVery Likely
arrayhash-map
Longest Substring Without Repeating Characters
SolveGiven a string s, find the length of the longest substring without duplicate characters.
MediumVery Likely
hash-tablestringsliding-window
Merge Intervals
SolveGiven an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...
MediumVery Likely
arraysorting
Climbing Stairs
SolveYou are climbing a staircase. It takes n steps to reach the top.
EasyVery Likely
mathdynamic-programmingmemoization
Kth Largest Element in an Array
SolveGiven an integer array nums and an integer k, return the kth largest element in the array.
MediumVery Likely
arraydivide-and-conquersorting
Subarray Sum Equals K
SolveGiven an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k.
MediumVery Likely
arrayhash-tableprefix-sum
Roman to Integer
SolveRoman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
EasyVery Likely
hash-tablemathstring
3Sum
SolveGiven an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
MediumVery Likely
arraytwo-pointerssorting
Preparing for your AMD coding interview
AMD interviews focus heavily on array, math, hash-table problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. AMD interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Frequently Asked Questions
What coding problems does AMD ask in interviews?add
AMD has been reported to ask 11 distinct coding problems. The most common topics are array, math, hash-table. 4 are Easy difficulty, 7 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
How hard are AMD coding interviews?add
Based on 11 reported problems, AMD interviews are easier than average - only 0% Hard compared to 18% across all companies. 64% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
How should I prepare for a AMD coding interview?add
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, math, hash-table. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Other companies to explore
Ready to ace your AMD interview?
Simulate a real AMD coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a AMD interview with AIarrow_forward