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 9 of 17
- Increasing Decreasing String3 companiesJunior
- Find the Longest Substring Containing Vowels in Even Counts6 companiesMid/Senior
- Longest ZigZag Path in a Binary Tree2 companiesMid/Senior
- Maximum Sum BST in Binary Tree5 companiesStaff
- Time Needed to Inform All Employees5 companiesMid/Senior
- Lucky Numbers in a Matrix3 companiesJunior
- Balance a Binary Search Tree5 companiesMid/Senior
- Maximum Performance of a Team8 companiesStaff
- Find the Distance Value Between Two Arrays6 companiesJunior
- Pizza With 3n Slices2 companiesStaff
- Create Target Array in the Given Order4 companiesJunior
- Four Divisors6 companiesMid/Senior
- Longest Happy Prefix5 companiesStaff
- Find Lucky Integer in an Array6 companiesJunior
- Count Number of Teams4 companiesMid/Senior
- Count Largest Group5 companiesJunior
- Construct K Palindrome Strings6 companiesMid/Senior
- Minimum Subsequence in Non-Increasing Order2 companiesJunior
- Number of Steps to Reduce a Number in Binary Representation to One7 companiesMid/Senior
- Longest Happy String8 companiesMid/Senior
- String Matching in an Array5 companiesJunior
- Queries on a Permutation With Key1 companyMid/Senior
- HTML Entity Parser3 companiesMid/Senior
- Number of Ways to Paint N × 3 Grid7 companiesStaff
- Minimum Value to Get Positive Step by Step Sum9 companiesJunior
- The k-th Lexicographical String of All Happy Strings of Length n5 companiesMid/Senior
- Maximum Score After Splitting a String3 companiesJunior
- Maximum Points You Can Obtain from Cards12 companiesMid/Senior
- Diagonal Traverse II5 companiesMid/Senior
- Kids With the Greatest Number of Candies6 companiesJunior
- Max Difference You Can Get From Changing an Integer6 companiesMid/Senior
- Destination City4 companiesJunior
- Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit15 companiesMid/Senior
- Find the Kth Smallest Sum of a Matrix With Sorted Rows2 companiesStaff
- Minimum Time to Collect All Apples in a Tree6 companiesMid/Senior
- Consecutive Characters4 companiesJunior
- Count Good Nodes in Binary Tree7 companiesMid/Senior
- Active Users2 companiesMid/Senior
- Check If a Word Occurs As a Prefix of Any Word in a Sentence6 companiesJunior
- Maximum Number of Vowels in a Substring of Given Length5 companiesMid/Senior
- Pseudo-Palindromic Paths in a Binary Tree2 companiesMid/Senior
- Max Dot Product of Two Subsequences5 companiesStaff
- Make Two Arrays Equal by Reversing Subarrays4 companiesJunior
- Check If a String Contains All Binary Codes of Size K5 companiesMid/Senior
- Course Schedule IV6 companiesMid/Senior
- Cherry Pickup II7 companiesStaff
- Maximum Product of Two Elements in an Array7 companiesJunior
- Reorder Routes to Make All Paths Lead to the City Zero5 companiesMid/Senior
- Shuffle the Array6 companiesJunior
- Final Prices With a Special Discount in a Shop7 companiesJunior
- Allocate Mailboxes4 companiesStaff
- Running Sum of 1d Array6 companiesJunior
- Least Number of Unique Integers after K Removals6 companiesMid/Senior
- Minimum Number of Days to Make m Bouquets9 companiesMid/Senior
- Avoid Flood in The City6 companiesMid/Senior
- Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree3 companiesStaff
- The kth Factor of n8 companiesMid/Senior
- Longest Subarray of 1's After Deleting One Element8 companiesMid/Senior
- Parallel Courses II3 companiesStaff
- Path Crossing3 companiesJunior
- Check If Array Pairs Are Divisible by k8 companiesMid/Senior
- Number of Subsequences That Satisfy the Given Sum Condition6 companiesMid/Senior
- Can Make Arithmetic Progression From Sequence5 companiesJunior
- Count Submatrices With All Ones4 companiesMid/Senior
- Range Sum of Sorted Subarray Sums3 companiesMid/Senior
- Minimum Difference Between Largest and Smallest Value in Three Moves2 companiesMid/Senior
- Number of Good Pairs10 companiesJunior
- Number of Substrings With Only 1s3 companiesMid/Senior
- Path with Maximum Probability5 companiesMid/Senior
- Water Bottles9 companiesJunior
- Maximum Number of Non-Overlapping Substrings1 companyStaff
- Count Odd Numbers in an Interval Range4 companiesJunior
- Number of Sub-arrays With Odd Sum6 companiesMid/Senior
- Number of Good Ways to Split a String2 companiesMid/Senior
- Minimum Number of Increments on Subarrays to Form a Target Array7 companiesStaff
- Minimum Suffix Flips5 companiesMid/Senior
- String Compression II5 companiesStaff
- Count Good Triplets5 companiesJunior
- Minimum Swaps to Arrange a Binary Grid2 companiesMid/Senior
- Kth Missing Positive Number9 companiesJunior
- Minimum Insertions to Balance a Parentheses String4 companiesMid/Senior
- Make The String Great4 companiesJunior
- Find Kth Bit in Nth Binary String5 companiesMid/Senior
- Minimum Cost to Cut a Stick8 companiesStaff
- Three Consecutive Odds5 companiesJunior
- Minimum Operations to Make Array Equal2 companiesMid/Senior
- Magnetic Force Between Two Balls10 companiesMid/Senior
- Minimum Numbers of Function Calls to Make Target Array1 companyMid/Senior
- Detect Cycles in 2D Grid6 companiesMid/Senior
- Maximum Number of Coins You Can Get1 companyMid/Senior
- Maximum Length of Subarray With Positive Product2 companiesMid/Senior
- Minimum Number of Days to Disconnect Island4 companiesStaff
- Matrix Diagonal Sum6 companiesJunior
- Shortest Subarray to be Removed to Make Array Sorted9 companiesMid/Senior
- Minimum Time to Make Rope Colorful3 companiesMid/Senior
- Special Positions in a Binary Matrix4 companiesJunior
- Min Cost to Connect All Points10 companiesMid/Senior
- Sum of All Odd Length Subarrays3 companiesJunior
- Make Sum Divisible by P7 companiesMid/Senior
- Split a String Into the Max Number of Unique Substrings5 companiesMid/Senior