Amazon interview questions

Showing 481–510 of 653 results

• Leadership Principle Stories: Ownership, Dive Deep, Tight Deadline, Disagree and CommitMedium

  Behavioral interview practice built around leadership principles: tell stories about taking ownership beyond your role, diving deep under repeated follow-ups, handling a tight deadline, and disagreeing with a teammate then committing. It tests first-person STAR storytelling, measurable results and mapping each story to the principle asked.

  AmazonSoftware EngineerBehavioral & LeadershipOnsite
• Leaf Domain Cumulative ScoresMedium

  This problem tests your ability to model hierarchical data using tree traversal and string manipulation to aggregate cumulative metrics across nested domains.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Learn What You Need to Solve an Unfamiliar ProblemMedium

  Explain learning through an unfamiliar engineering challenge, with a defined knowledge gap, targeted resources, practical validation, expert feedback, and application.

  AmazonSoftware EngineerBehavioral & LeadershipOnsite
• Learn and Apply a Front-End Technology Across DevicesMedium

  This question assesses a candidate's ability to self-teach new technologies and integrate them into a production environment while accounting for cross-platform performance and accessibility constraints.

  AmazonFrontend EngineerBehavioral & LeadershipOnsite
• List Top Customers and Monthly Order Counts in SQLMedium

  This question evaluates a candidate's ability to perform SQL aggregation, grouping, top‑N selection, and date-based summarization to compute customer spend and chronological monthly order counts.

  AmazonData ScientistData Manipulation (SQL/Python)Technical Screen
• List hyperparameter tuning methodsEasy

  This question evaluates understanding of hyperparameter tuning methods, including the competencies to compare different search strategies, analyze trade-offs in efficiency and parallelization, and design experiments to optimize model performance.

  AmazonApplied ScientistMachine LearningTechnical Screen
• Lowest Common Ancestor in a Binary Search TreeHard

  Tests finding the lowest common ancestor of two values in a Binary Search Tree represented as a level-order serialized list, accounting for self-ancestorship and missing-node edge cases.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Make Progress When Requirements Are AmbiguousEasy

  This question assesses the candidate's ability to navigate project uncertainty by balancing proactive momentum with risk management and stakeholder alignment.

  AmazonSoftware EngineerBehavioral & LeadershipTechnical Screen
• Make a Difficult Decision Under Competing ConstraintsMedium

  Tests your ability to navigate high-stakes technical or organizational trade-offs where constraints conflict, evaluate options objectively, communicate decisions with transparency, and take ownership of the outcomes.

  AmazonSoftware EngineerBehavioral & LeadershipOnsite
• Make an Important Decision Before Every Option Can Be ExploredMedium

  Explain a time-limited decision by identifying essential evidence, accepted uncertainty, reversible steps, stakeholder communication, and outcome checks.

  AmazonSoftware EngineerBehavioral & LeadershipOnsite
• Making a Decision with Missing DataMedium

  Tests a candidate's ability to demonstrate Amazon's 'Bias for Action' and 'Are Right, A Lot' leadership principles by executing a calculated, high-impact decision under uncertainty with clear rollback triggers.

  AmazonSoftware EngineerBehavioral & LeadershipOnsite
• Manipulate time-series with Pandas groupbyMedium

  This question evaluates proficiency in time-series data manipulation, including timezone-aware datetime parsing and DST handling, groupby and rolling-window aggregations, resampling to fill calendar gaps, and user-level retention and DAU calculations using idiomatic, vectorized Pandas or SQL operations.

  AmazonSoftware EngineerData Manipulation (SQL/Python)Technical Screen
• Max total of k consecutive bags over disjoint valued segments, modulo 1e9+7Medium

  Disjoint segments [l, r, v] give every bag from position l to r the value v, and all other bags in an endless row are empty. Find the largest total over k consecutive bags, returned modulo 1,000,000,007, when k and positions reach 10^9, testing window sums over sparse ranges that cut through segments.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize Money in K Consecutive BagsHard

  This problem tests your ability to efficiently manage interval operations and sliding window logic on a sparse coordinate system.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize Value Under a BudgetMedium

  This problem tests your ability to solve a variation of the 0/1 Knapsack problem where items must be selected to maximize total value without exceeding a specific budget constraint.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize capacity with primary-backup pairingMedium

  This problem tests your ability to optimize resource pairing using greedy strategies or sorting to maximize total capacity under specific pair-wise constraints.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize credits with limited skipsMedium

  This question evaluates algorithm design and optimization skills in resource allocation under constraints, focusing on decision-making to maximize credits when turn-taking and limited skips affect processing.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize memory capacity with primary-backup serversHard

  This question evaluates algorithmic reasoning in constrained pairings and resource allocation, focusing on maximizing aggregate memory under pairwise feasibility constraints while managing large input sizes.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize protected population and bitwise ANDHard

  This problem tests your ability to optimize resource allocation using greedy approaches with priority queues and bitwise bit-manipulation techniques to satisfy mathematical constraints.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize protected population with one-step guard shiftsMedium

  This question evaluates the ability to reason about constrained local moves and optimize a numerical objective over an array, testing skills in array manipulation, combinatorial optimization, and interpretation of binary state representations.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize the number of binary strings chosen under zero and one budgetsMedium

  Given a list of binary strings and separate limits on the total number of zeros and ones, find the largest number of strings that can be chosen together without exceeding either limit. Tests optimization under two simultaneous resource limits, moving from brute force to an efficient method, and complexity analysis.

  AmazonFrontend EngineerCoding & AlgorithmsTechnical Screen
• Maximize total bandwidth of data channel pairsHard

  This question evaluates a candidate's ability to design efficient algorithms for combinatorial optimization and selection under constraints, testing understanding of array manipulation, ordered pair counting, and aggregation of bandwidth sums.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize weighted subsequence pairs with wildcardsMedium

  This question evaluates combinatorial counting, string manipulation, and optimization under constraints, along with handling large-number results via modular arithmetic.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximum Profit Assigning Tasks to Exact-Skill Workers Plus One Wildcard WorkerMedium

  Assign tasks to workers whose skill must exactly equal each task's requirement, with one extra worker who may take any single task, and return the maximum total profit. It tests making the best use of limited workers per skill level, the single wildcard worker, and large sums that exceed 32 bits.

  AmazonSoftware EngineerCoding & AlgorithmsOther
• Mean and Variance Through Maximum LikelihoodMedium

  Derive the maximum likelihood estimators (MLE) for the mean and variance of a univariate Gaussian distribution, and analyze the bias of the resulting variance estimator.

  AmazonApplied ScientistStatistics & MathOnsite
• Measure platform success and drive adoptionMedium

  This question assesses your ability to design a telemetry and feedback system for an internal developer platform to measure adoption, identify friction points, and drive cross-team migration.

  AmazonSoftware EngineerSystem DesignOnsite
• Median of a Data StreamMedium

  Design a data structure that continuously receives a stream of integers and efficiently supports retrieving the current running median, handling potential integer overflow during the median calculation.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Merge K Sorted Arrays Without DuplicatesMedium

  This problem tests your ability to efficiently merge multiple sorted sequences into a single sorted stream while managing duplicate values using a priority queue.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Merge Multiple Sorted ArraysMedium

  This problem tests your ability to efficiently merge multiple sorted arrays into a single sorted list using a priority queue (min-heap) to optimize performance.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Merge Overlapping Time RangesMedium

  This problem tests your ability to manipulate arrays of intervals by sorting and merging, evaluating your proficiency with pointer manipulation and interval arithmetic.

  AmazonApplied ScientistCoding & AlgorithmsTechnical Screen