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.
- Junior26% (417)
- Mid/Senior56% (910)
- Staff18% (299)
Questionspage 15 of 17
- Maximum Size of a Set After Removals2 companiesMid/Senior
- Count Elements With Maximum Frequency8 companiesJunior
- Divide an Array Into Subarrays With Minimum Cost I6 companiesJunior
- Find if Array Can Be Sorted5 companiesMid/Senior
- Divide an Array Into Subarrays With Minimum Cost II4 companiesStaff
- Minimum Number of Pushes to Type Word I4 companiesJunior
- Minimum Number of Pushes to Type Word II2 companiesMid/Senior
- Number of Changing Keys5 companiesJunior
- Find the Maximum Number of Elements in Subset2 companiesMid/Senior
- Alice and Bob Playing Flower Game5 companiesMid/Senior
- Find the Number of Ways to Place People I4 companiesMid/Senior
- Maximum Good Subarray Sum6 companiesMid/Senior
- Ant on the Boundary3 companiesJunior
- Number of Subarrays That Match a Pattern I5 companiesMid/Senior
- Find the Length of the Longest Common Prefix17 companiesMid/Senior
- Minimum Operations to Exceed Threshold Value II4 companiesMid/Senior
- Distribute Elements Into Two Arrays I2 companiesJunior
- Minimum Operations to Write the Letter Y on a Grid7 companiesMid/Senior
- Maximize Happiness of Selected Children3 companiesMid/Senior
- Maximum Strength of K Disjoint Subarrays2 companiesStaff
- Replace Question Marks in String to Minimize Its Value1 companyMid/Senior
- Most Frequent IDs2 companiesMid/Senior
- Water Bottles II3 companiesMid/Senior
- Longest Strictly Increasing or Strictly Decreasing Subarray7 companiesJunior
- Minimum Cost Walk in Weighted Graph6 companiesStaff
- Score of a String5 companiesJunior
- Find the Number of Subarrays Where Boundary Elements Are Maximum2 companiesStaff
- Count the Number of Special Characters I2 companiesJunior
- Count the Number of Special Characters II2 companiesMid/Senior
- Find All Possible Stable Binary Arrays I3 companiesMid/Senior
- Find All Possible Stable Binary Arrays II2 companiesStaff
- Minimum Array End4 companiesMid/Senior
- Find the Median of the Uniqueness Array2 companiesStaff
- Valid Word8 companiesJunior
- Minimum Cost to Equalize Array2 companiesStaff
- Taking Maximum Energy From the Mystic Dungeon5 companiesMid/Senior
- Special Array I6 companiesJunior
- Special Array II6 companiesMid/Senior
- Find Number of Ways to Reach the K-th Stair1 companyStaff
- Find Occurrences of an Element in an Array3 companiesMid/Senior
- Find the Number of Distinct Colors Among the Balls3 companiesMid/Senior
- Find the Number of Good Pairs I2 companiesJunior
- String Compression III7 companiesMid/Senior
- Find the Number of Good Pairs II2 companiesMid/Senior
- Minimum Number of Chairs in a Waiting Room3 companiesJunior
- Count Days Without Meetings4 companiesMid/Senior
- Lexicographically Minimum String After Removing Stars7 companiesMid/Senior
- Clear Digits5 companiesJunior
- Maximum Total Damage With Spell Casting7 companiesMid/Senior
- Find Minimum Operations to Make All Elements Divisible by Three4 companiesJunior
- Minimum Operations to Make Binary Array Elements Equal to One I6 companiesMid/Senior
- Count the Number of Inversions4 companiesStaff
- Minimum Average of Smallest and Largest Elements2 companiesJunior
- Find the Minimum Area to Cover All Ones I5 companiesMid/Senior
- Find the Minimum Area to Cover All Ones II4 companiesStaff
- Find the Maximum Length of Valid Subsequence I4 companiesMid/Senior
- Find the Maximum Length of Valid Subsequence II6 companiesMid/Senior
- Alternating Groups I3 companiesJunior
- Generate Binary Strings Without Adjacent Zeros4 companiesMid/Senior
- Count Submatrices With Equal Frequency of X and Y3 companiesMid/Senior
- Delete Nodes From Linked List Present in Array5 companiesMid/Senior
- Minimum Length of String After Operations3 companiesMid/Senior
- Maximum Score From Grid Operations3 companiesStaff
- Vowels Game in a String3 companiesMid/Senior
- Maximum Number of Operations to Move Ones to the End4 companiesMid/Senior
- Minimum Operations to Make Array Equal to Target4 companiesStaff
- Count the Number of Substrings With Dominant Ones5 companiesMid/Senior
- Check if the Rectangle Corner Is Reachable3 companiesStaff
- Shortest Distance After Road Addition Queries I3 companiesMid/Senior
- Find the Largest Palindrome Divisible by K2 companiesStaff
- Final Array State After K Multiplication Operations I4 companiesJunior
- Final Array State After K Multiplication Operations II3 companiesStaff
- Minimum Amount of Damage Dealt to Bob1 companyStaff
- Check if Two Chessboard Squares Have the Same Color3 companiesJunior
- Maximize Score of Numbers in Ranges2 companiesMid/Senior
- The Two Sneaky Numbers of Digitville4 companiesJunior
- Minimum Number of Seconds to Make Mountain Height Zero3 companiesMid/Senior
- Count Substrings That Can Be Rearranged to Contain a String I1 companyMid/Senior
- Find the K-th Character in String Game I5 companiesJunior
- Count of Substrings Containing Every Vowel and K Consonants II3 companiesMid/Senior
- Find the K-th Character in String Game II3 companiesStaff
- Maximum Possible Number by Binary Concatenation2 companiesMid/Senior
- Construct the Minimum Bitwise Array I5 companiesJunior
- Construct the Minimum Bitwise Array II4 companiesMid/Senior
- Find the Number of Possible Ways for an Event1 companyStaff
- Find X-Sum of All K-Long Subarrays I5 companiesJunior
- Minimum Division Operations to Make Array Non Decreasing2 companiesMid/Senior
- Find the Original Typed String I7 companiesJunior
- Find the Original Typed String II5 companiesStaff
- Total Characters in String After Transformations I4 companiesMid/Senior
- Check Balanced String1 companyJunior
- Find Minimum Time to Reach Last Room II3 companiesMid/Senior
- Maximum Frequency of an Element After Performing Operations I4 companiesMid/Senior
- Maximum Frequency of an Element After Performing Operations II3 companiesStaff
- Adjacent Increasing Subarrays Detection I4 companiesJunior
- Make Array Elements Equal to Zero5 companiesJunior
- Zero Array Transformation I5 companiesMid/Senior
- Zero Array Transformation II5 companiesMid/Senior
- Minimize the Maximum Adjacent Element Difference1 companyStaff
- Zero Array Transformation III5 companiesMid/Senior