All Amazon Coding Interview Questions
1626 questions we track for Amazon, most frequently asked first. Practice any of them in the code editor and get AI feedback on your solution.
Start your Amazon mock interviewQuestions Amazon asks, live voice, scored. First one free.
- Junior26% (417)
- Mid/Senior56% (910)
- Staff18% (299)
Questionspage 14 of 17
- Check Knight Tour Configuration4 companiesMid/Senior
- The Number of Beautiful Subsets4 companiesMid/Senior
- Smallest Missing Non-negative Integer After Operations6 companiesMid/Senior
- Prime Subtraction Operation4 companiesMid/Senior
- Minimum Operations to Make All Array Elements Equal3 companiesMid/Senior
- Find the Substring With Maximum Cost2 companiesMid/Senior
- Sum of Distances5 companiesMid/Senior
- Minimize the Maximum Difference of Pairs6 companiesMid/Senior
- Cousins in Binary Tree II2 companiesMid/Senior
- Row With Maximum Ones4 companiesJunior
- Minimum Additions to Make Valid String4 companiesMid/Senior
- Sliding Subarray Beauty1 companyMid/Senior
- Minimum Number of Operations to Make All Array Elements Equal to 12 companiesMid/Senior
- Maximum Sum With Exactly K Elements1 companyJunior
- Find the Prefix Common Array of Two Arrays6 companiesMid/Senior
- Maximum Number of Fish in a Grid4 companiesMid/Senior
- First Completely Painted Row or Column5 companiesMid/Senior
- Lexicographically Smallest Beautiful String2 companiesStaff
- Number of Adjacent Elements With the Same Color7 companiesMid/Senior
- Neighboring Bitwise XOR2 companiesMid/Senior
- Count the Number of Complete Components3 companiesMid/Senior
- Minimum String Length After Removing Substrings5 companiesJunior
- Lexicographically Smallest Palindrome4 companiesJunior
- Find the Punishment Number of an Integer4 companiesMid/Senior
- Buy Two Chocolates1 companyJunior
- Extra Characters in a String3 companiesMid/Senior
- Lexicographically Smallest String After Substring Operation4 companiesMid/Senior
- Collecting Chocolates2 companiesMid/Senior
- Painting the Walls6 companiesStaff
- Count Zero Request Servers5 companiesMid/Senior
- Minimum Operations to Make the Integer Zero4 companiesMid/Senior
- Robot Collisions6 companiesStaff
- Continuous Subarrays6 companiesMid/Senior
- Relocate Marbles1 companyMid/Senior
- Find the Maximum Achievable Number4 companiesJunior
- Maximum Number of Jumps to Reach the Last Index2 companiesMid/Senior
- Longest Non-decreasing Subarray From Two Arrays5 companiesMid/Senior
- Apply Operations to Make All Array Elements Equal to Zero3 companiesMid/Senior
- Maximum Beauty of an Array After Applying Operation2 companiesMid/Senior
- Minimum Index of a Valid Split3 companiesMid/Senior
- Length of the Longest Valid Substring3 companiesStaff
- Sort Vowels in a String4 companiesMid/Senior
- Ways to Express an Integer as Sum of Powers5 companiesMid/Senior
- Split Strings by Separator3 companiesJunior
- Largest Element in an Array after Merge Operations2 companiesMid/Senior
- Maximum Number of Groups With Increasing Length1 companyStaff
- Number of Employees Who Met the Target2 companiesJunior
- Count Complete Subarrays in an Array4 companiesMid/Senior
- Count Stepping Numbers in Range2 companiesStaff
- Insert Greatest Common Divisors in Linked List5 companiesMid/Senior
- Minimum Seconds to Equalize a Circular Array1 companyMid/Senior
- Max Pair Sum in an Array4 companiesJunior
- Double a Number Represented as a Linked List3 companiesMid/Senior
- Count Pairs Whose Sum is Less than Target7 companiesJunior
- Make String a Subsequence Using Cyclic Increments1 companyMid/Senior
- Check if a String Is an Acronym of Words2 companiesJunior
- Maximize the Profit as the Salesman1 companyMid/Senior
- Check if Strings Can be Made Equal With Operations II4 companiesMid/Senior
- Maximum Sum of Almost Unique Subarray1 companyMid/Senior
- Count Symmetric Integers5 companiesJunior
- Minimum Right Shifts to Sort the Array2 companiesJunior
- Minimum Edge Reversals So Every Node Is Reachable10 companiesStaff
- Happy Students1 companyMid/Senior
- Maximum Odd Binary Number3 companiesJunior
- Minimum Number of Operations to Make Array Empty2 companiesMid/Senior
- Maximum Number of K-Divisible Components4 companiesStaff
- Maximum Value of an Ordered Triplet I4 companiesJunior
- Maximum Value of an Ordered Triplet II5 companiesMid/Senior
- Divisible and Non-divisible Sums Difference4 companiesJunior
- Construct Product Matrix4 companiesMid/Senior
- Minimum Number of Groups to Create a Valid Assignment1 companyMid/Senior
- Length of the Longest Subsequence That Sums to Target3 companiesMid/Senior
- Subarrays Distinct Element Sum of Squares II1 companyStaff
- Find the K-or of an Array1 companyJunior
- Minimum Equal Sum of Two Arrays After Replacing Zeros5 companiesMid/Senior
- Maximum Balanced Subsequence Sum1 companyStaff
- Distribute Candies Among Children I2 companiesJunior
- Distribute Candies Among Children II5 companiesMid/Senior
- High-Access Employees3 companiesMid/Senior
- Make Three Strings Equal1 companyJunior
- Separate Black and White Balls5 companiesMid/Senior
- Find Building Where Alice and Bob Can Meet5 companiesStaff
- Find Words Containing Character6 companiesJunior
- Maximize Area of Square Hole in Grid4 companiesMid/Senior
- Find Maximum Non-decreasing Array Length4 companiesStaff
- Matrix Similarity After Cyclic Shifts5 companiesJunior
- Count Beautiful Substrings I1 companyMid/Senior
- Make Lexicographically Smallest Array by Swapping Elements5 companiesMid/Senior
- Count Beautiful Substrings II1 companyStaff
- Minimum Number of Coins to be Added2 companiesMid/Senior
- Find Common Elements Between Two Arrays5 companiesJunior
- Length of Longest Subarray With at Most K Frequency4 companiesMid/Senior
- Count Subarrays Where Max Element Appears at Least K Times6 companiesMid/Senior
- Find Missing and Repeated Values6 companiesJunior
- Divide Array Into Arrays With Max Difference6 companiesMid/Senior
- Find Number of Coins to Place in Tree Nodes1 companyStaff
- Minimum Cost to Convert String I4 companiesMid/Senior
- Minimum Cost to Convert String II4 companiesStaff
- Find Longest Special Substring That Occurs Thrice I5 companiesMid/Senior
- Minimum Number of Operations to Make Array XOR Equal to K3 companiesMid/Senior