Amazon online assessment interview

Round 1 of 7 · 44 questions reported

See the whole loop
Format
Coding problems plus a repository bug-fix section with a built-in assistant or a design scenario, then a work-style survey
AI use
AI only inside the bug-fix section's built-in assistant
Heads-up
Mostly new-grad, intern and SDE II pipelines.

Questions Amazon asks in this round 44

  • Fix a bug in an unfamiliar repo with an AI assistantCodingYou get a small full-stack repository, a reported defect and an AI coding assistant in the browser. Reproduce the problem, find the root cause, fix it and show the fix works…
    Last asked Sep 2026
  • Work style and situational judgment assessmentBehavioralSome online assessments include a part with no code at all. You read short workplace scenarios and rate or rank possible responses, then choose between pairs of statements about…
    Last asked Sep 2026
  • Shortest delivery route around a ring of hubsCodingDrone hubs sit on a ring, and you know the distance between each hub and its neighbour. The drone visits a list of destination hubs in order, and each leg takes the shorter way…
    Last asked Jun 2026
  • Maximum coins from k consecutive bagsCodingBags stand at every positive integer position. Each segment l, r, v says every bag from l to r holds v; segments don't overlap and all other bags are empty. Choose k consecutive…
    Last asked Sep 2026
  • Add one delivery center to minimize the worst distanceCodingA grid marks delivery centers with 1 and every other cell with 0. The distance between two cells is max(x1 - x2, y1 - y2) (moving in all eight directions). The grid's…
    Last asked Sep 2026
  • Fewest global replacements to group equal valuesCodingYou are given an integer array arr of length n. In one operation you pick two different values x and y that both currently appear in arr, and you change every occurrence of x into…
    Last asked Aug 2026
  • Merge intervalsCodingGiven a list of intervals (for example time ranges), merge every group of overlapping intervals and return the result in sorted order.
    Last asked Aug 2026
  • Single-direction stock rebalancing on a ringCodingA company keeps stock in n depots placed around a ring. Depot i is joined to depot (i + 1) % n (the clockwise neighbour) and, through the same link, to depot (i - 1 + n) % n…
    Last asked Jun 2026
  • Shift security units left to protect the most populationCodingCities stand in a row, numbered 0 to n - 1. You are given an integer array population of length n (all values = 0) and a binary string unit of the same length. uniti == '1' means…
    Last asked Apr 2026
  • Pair servers as primary and backup to maximize memoryCodingEach server has a memory size. Choose servers and group them into pairs, each pair a primary and a backup, where the backup must be able to take over for its primary (its memory…
    Last asked Jan 2026
  • Can repeated pair additions reach a target pointCodingFrom a starting point (x, y) you may move to (x + y, y) or (x, x + y). Decide whether a target point is reachable, efficiently even for very large coordinates.
    Possibly retired
  • Earliest time a password becomes irrecoverableCodingA password is attacked one character at a time: you get the order in which positions are replaced by '', one per second. The password counts as irrecoverable once at least m of…
    Possibly retired
  • Longest subarray whose ends exceed everything betweenCodingGiven an integer array, return the length of the longest contiguous subarray whose first and last elements are both greater than every element strictly between them. Do better…
    Possibly retired
  • Task delay times from the farthest smaller priorityCodingTask priorities are given in an array and processed from right to left. A task's delay time is the distance from it to the farthest task on its right that has a smaller priority…
    Possibly retired
  • Unload warehouses in turns with limited skipsCodingYou and a co-worker empty warehouses one at a time; warehouse i holds ci items. You take turns: you remove m items per turn and your co-worker removes n. You earn a point for a…
    Possibly retired
  • Fewest passes to collect a permutation in orderCodingA shelf holds a permutation of 1..n. Starting with target 1, you scan the shelf left to right, and whenever you see the current target you take it and look for the next number…
    Possibly retired
  • Largest permutation after sorting one fixed-length windowCodingYou get a permutation of 1 to n and a window size w. Exactly once, choose a contiguous window of exactly w elements and sort the elements inside it. Return the lexicographically…
    Last asked Oct 2026
  • Reversi move simulation with captures in 8 directionsCodingImplement one move of the board game Reversi (also sold as Othello). You get an n x n board as a list of lists of characters. Each cell is 'B' (black), 'W' (white) or '.' (empty)…
    Last asked Sep 2026
  • Minimum adjacent swaps to group a binary arrayCodingGiven an array of 0s and 1s, return the fewest swaps of neighbouring elements that put all the 0s at one end and all the 1s at the other. Either order is allowed.
    Last asked Aug 2026
  • Shortest grid path with one cell conversionCodingFind the length of the shortest path across a grid when you are allowed to convert one blocked cell into an open one along the way.
    Last asked Jun 2026
  • Allocate inventory by bid priorityCodingAllocate a limited inventory across a set of bids, serving the bids in priority order, and report what each bid receives.
    Last asked Jun 2026
  • Sort an array with rotate and flip operationsCodingYou are given an array arr of n distinct integers. You may apply two operations, and each one counts as one step: - Rotate: remove the first element and append it to the end. p…
    Last asked May 2026
  • Longest ON run with k range flipsCodingA data center rack holds n servers in a row. Their states are given as a binary string serverstates, where '1' means the server is ON and '0' means it is OFF. An operator may run…
    Last asked Apr 2026
  • Minimum range boosts to make server power non-decreasingCodingYou manage a row of n machines. Machine i has an integer capacity poweri. You want the capacities to be non-decreasing from left to right (poweri <= poweri+1 for every i). You may…
    Last asked Mar 2026
  • Group anagramsCodingGroup the words in a list that are anagrams of one another, keeping repeated words. Build the grouping key from letter counts instead of sorting each word.
    Last asked Mar 2026
  • Max area of islandCodingGiven a binary matrix, return the area of the largest island: a group of 1 cells connected up, down, left or right (diagonals don't connect).
    Last asked Mar 2026
  • Number of islandsCodingGiven a binary matrix, return how many islands it has: groups of 1 cells connected up, down, left or right (diagonals don't connect).
    Last asked Mar 2026
  • Weighted 01 and 10 subsequence pairs with wildcardsCodingA status string holds '0', '1' and '!'. Every pair of positions i < j that reads 0 then 1 (a subsequence, not a substring) costs x, and every pair that reads 1 then 0 costs y…
    Last asked Jan 2026
  • Fewest conflicts when merging branchesCodingSeveral branches have to be merged, and the order of the merges changes how many commit conflicts come up. Given the branches and how conflicts arise between them, return the…
    Last asked Jan 2026
  • H-index of instance ratingsCodingGiven the integer ratings of a set of instances, return the largest integer k such that at least k instances have a rating of k or more (return 0 when no such k exists). Do it…
    Last asked Jan 2026
  • Fleet capacity after server id replacementsCodingA service runs on a fleet of n servers. Each server has an integer id, and a server with id x can handle x requests at a time. The fleet's total capacity is the sum of all server…
    Possibly retired
  • Most distinct values of B[i] mod A[i]CodingYou get an array A of n positive integers. You choose any array B of length n, and compute Bi % Ai for every i. Return the largest possible number of distinct values among these…
    Possibly retired
  • Most optional tasks under a daily time limitCodingEach day has the same time limit. Every day must run its required task; if time allows, it can also run one optional task. You get n required durations (one per day) and n…
    Possibly retired
  • Order jumps between blocks to burn the most caloriesCodingYou stand on the ground (height 0) next to n blocks of given heights. You must jump onto every block exactly once, in any order, and you never return to the ground. A jump from…
    Possibly retired
  • Most equal values after shifting one subarrayCodingGiven an array, you may once choose any contiguous subarray and add the same integer (positive or negative) to all of its elements. Return the largest number of equal values the…
    Possibly retired
  • Basic calculator IICodingEvaluate a string expression of non-negative integers with +, -, , / and spaces, no parentheses, respecting precedence (integer division truncates toward zero). Variants reported:…
    Possibly retired
  • Most days picking distinct productsCodingYou have quantities of several products. On day i (starting at 1) you must pick exactly i items, each from a different product, out of what is left. Return the largest number of…
    Possibly retired