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 12 of 17
- Sum of Subarray Ranges10 companiesMid/Senior
- Maximum Fruits Harvested After at Most K Steps5 companiesStaff
- Adding Spaces to a String5 companiesMid/Senior
- Number of Smooth Descent Periods of a Stock3 companiesMid/Senior
- Minimum Operations to Make the Array K-Increasing1 companyStaff
- Maximum Number of Words Found in Sentences4 companiesJunior
- Find All Possible Recipes from Given Supplies11 companiesMid/Senior
- Check if a Parentheses String Can Be Valid7 companiesMid/Senior
- A Number After a Double Reversal4 companiesJunior
- Number of Laser Beams in a Bank2 companiesMid/Senior
- Maximum Employees to Be Invited to a Meeting5 companiesStaff
- Maximum Twin Sum of a Linked List6 companiesMid/Senior
- Longest Palindrome by Concatenating Two Letter Words6 companiesMid/Senior
- Minimum Swaps to Group All 1's Together II10 companiesMid/Senior
- Minimum Moves to Reach Target Score3 companiesMid/Senior
- Solving Questions With Brainpower5 companiesMid/Senior
- Maximum Running Time of N Computers6 companiesStaff
- Count the Hidden Sequences6 companiesMid/Senior
- Rearrange Array Elements by Sign6 companiesMid/Senior
- Minimum Sum of Four Digit Number After Splitting Digits2 companiesJunior
- Partition Array According to Given Pivot4 companiesMid/Senior
- Minimum Difference in Sums After Removal of Elements7 companiesStaff
- Count Operations to Obtain Zero4 companiesJunior
- Minimum Operations to Make the Array Alternating2 companiesMid/Senior
- Merge Nodes in Between Zeros5 companiesMid/Senior
- Minimum Time to Complete Trips5 companiesMid/Senior
- Sort the Jumbled Numbers4 companiesMid/Senior
- All Ancestors of a Node in a Directed Acyclic Graph4 companiesMid/Senior
- Minimum Number of Moves to Make Palindrome5 companiesStaff
- Append K Integers With Minimal Sum2 companiesMid/Senior
- Create Binary Tree From Descriptions5 companiesMid/Senior
- Replace Non-Coprime Numbers in Array5 companiesStaff
- Find All K-Distant Indices in an Array4 companiesJunior
- Divide Array Into Equal Pairs5 companiesJunior
- Maximize Number of Subsequences in a String1 companyMid/Senior
- Count Hills and Valleys in an Array5 companiesJunior
- Count Collisions on a Road3 companiesMid/Senior
- Find the Difference of Two Arrays8 companiesJunior
- Minimum Bit Flips to Convert Number7 companiesJunior
- Find Triangular Sum of an Array5 companiesMid/Senior
- Number of Ways to Select Buildings3 companiesMid/Senior
- Sum of Scores of Built Strings1 companyStaff
- Maximum Candies Allocated to K Children6 companiesMid/Senior
- Add Two Integers9 companiesJunior
- Root Equals Sum of Children5 companiesJunior
- Find Closest Number to Zero6 companiesJunior
- Minimum Rounds to Complete All Tasks2 companiesMid/Senior
- Longest Path With Different Adjacent Characters5 companiesStaff
- Count Number of Rectangles Containing Each Point2 companiesMid/Senior
- Minimum Average Difference2 companiesMid/Senior
- Count Unguarded Cells in the Grid6 companiesMid/Senior
- Escape the Spreading Fire4 companiesStaff
- Remove Digit From Number to Maximize Result6 companiesJunior
- K Divisible Elements Subarrays3 companiesMid/Senior
- Total Appeal of A String2 companiesStaff
- Count Nodes Equal to Average of Subtree5 companiesMid/Senior
- Count Number of Texts3 companiesMid/Senior
- Number of Ways to Split Array7 companiesMid/Senior
- Substring With Largest Variance1 companyStaff
- Find Resultant Array After Removing Anagrams8 companiesJunior
- Maximum Consecutive Floors Without Special Floors1 companyMid/Senior
- Largest Combination With Bitwise AND Greater Than Zero5 companiesMid/Senior
- Maximum Bags With Full Capacity of Rocks1 companyMid/Senior
- Sum of Total Strength of Wizards2 companiesStaff
- Maximum Total Importance of Roads2 companiesMid/Senior
- Rearrange Characters to Make Target String1 companyJunior
- Apply Discount to Prices1 companyMid/Senior
- Minimum Obstacle Removal to Reach Corner3 companiesStaff
- Partition Array Such That Maximum Difference Is K2 companiesMid/Senior
- Replace Elements in an Array1 companyMid/Senior
- Successful Pairs of Spells and Potions7 companiesMid/Senior
- Count Subarrays With Score Less Than K5 companiesStaff
- Minimum Path Cost in a Grid2 companiesMid/Senior
- Fair Distribution of Cookies2 companiesMid/Senior
- Longest Binary Subsequence Less Than or Equal to K3 companiesMid/Senior
- Count Unreachable Pairs of Nodes in an Undirected Graph4 companiesMid/Senior
- Maximum XOR After Operations2 companiesMid/Senior
- Check if Matrix Is X-Matrix2 companiesJunior
- Count Number of Ways to Place Houses4 companiesMid/Senior
- Minimum Score After Removals on a Tree4 companiesStaff
- Decode the Message4 companiesJunior
- Number of People Aware of a Secret6 companiesMid/Senior
- Minimum Sum of Squared Difference3 companiesMid/Senior
- Subarray With Elements Greater Than Varying Threshold4 companiesStaff
- Move Pieces to Obtain a String5 companiesMid/Senior
- Count the Number of Ideal Arrays4 companiesStaff
- Max Sum of a Pair With Equal Sum of Digits6 companiesMid/Senior
- Minimum Deletions to Make Array Divisible3 companiesStaff
- Best Poker Hand2 companiesJunior
- Number of Zero-Filled Subarrays4 companiesMid/Senior
- Equal Row and Column Pairs6 companiesMid/Senior
- Make Array Zero by Subtracting Equal Amounts2 companiesJunior
- Find Closest Node to Given Two Nodes4 companiesMid/Senior
- Longest Cycle in a Graph4 companiesStaff
- Count Number of Bad Pairs4 companiesMid/Senior
- Task Scheduler II6 companiesMid/Senior
- Construct Smallest Number From DI String3 companiesMid/Senior
- Minimum Recolors to Get K Consecutive Black Blocks5 companiesJunior
- Time Needed to Rearrange a Binary String5 companiesMid/Senior
- Shifting Letters II6 companiesMid/Senior