practice a little every day, paws crossed ♡
Interview Questions
Practice 9403 coding, system design and machine learning questions from 546 companies, sorted by role, topic and interview round. Every question has step-by-step hints, a code runner that supports 8 languages and an AI mentor; members also get the full solution walkthrough.
- 9403
- Questions
- 546
- Companies
- 11
- Topics
- 8
- Languages
Showing 781–810 of 9403 results
- AmazonHardSoftware EngineerMaximize memory capacity with primary-backup servers
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.
Coding & AlgorithmsOnline Assessment - AmazonHardSoftware EngineerMaximize protected population and bitwise AND
This problem tests your ability to optimize resource allocation using greedy approaches with priority queues and bitwise bit-manipulation techniques to satisfy mathematical constraints.
Coding & AlgorithmsOnline AssessmentGreedyBit ManipulationPriority Queue - AmazonMediumSoftware EngineerMaximize protected population with one-step guard shifts
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.
Coding & AlgorithmsOnline Assessment - AmazonMediumFrontend EngineerMaximize the number of binary strings chosen under zero and one budgets
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.
Coding & AlgorithmsTechnical Screen - AmazonHardSoftware EngineerMaximize total bandwidth of data channel pairs
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.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerMaximize weighted subsequence pairs with wildcards
This question evaluates combinatorial counting, string manipulation, and optimization under constraints, along with handling large-number results via modular arithmetic.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerMaximum Profit Assigning Tasks to Exact-Skill Workers Plus One Wildcard Worker
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.
Coding & AlgorithmsOther - AmazonMediumApplied ScientistMean and Variance Through Maximum Likelihood
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.
Statistics & MathOnsitemaximum-likelihoodgaussian-distributionbias-variance - AmazonMediumSoftware EngineerMeasure platform success and drive adoption
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.
System DesignOnsiteTelemetryDeveloper ExperienceMetrics - AmazonMediumSoftware EngineerMedian of a Data Stream
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.
Coding & AlgorithmsOnsiteHeapData StreamDesign - AmazonMediumSoftware EngineerMerge K Sorted Arrays Without Duplicates
This problem tests your ability to efficiently merge multiple sorted sequences into a single sorted stream while managing duplicate values using a priority queue.
Coding & AlgorithmsTechnical ScreenHeapsSortingArrays - AmazonMediumSoftware EngineerMerge Multiple Sorted Arrays
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.
Coding & AlgorithmsTechnical ScreenArraysHeapSorting - AmazonMediumApplied ScientistMerge Overlapping Time Ranges
This problem tests your ability to manipulate arrays of intervals by sorting and merging, evaluating your proficiency with pointer manipulation and interval arithmetic.
Coding & AlgorithmsTechnical ScreenArraysSortingIntervals - AmazonHardSoftware EngineerMerge Two Job Queues With the Fewest Urgency Inversions
Interleave two digit sequences, keeping each one's order, so that the merged sequence has as few inversions as possible. Tests charging each inversion to its earlier element, which turns the problem into an O(mn) grid DP.
Coding & AlgorithmsOnline Assessmentdynamic-programmingstringsinversions - AmazonMediumSoftware EngineerMerge overlapping and adjacent ranges
This question evaluates a candidate's understanding of interval merging and range manipulation, including handling overlapping and adjacent ranges, edge cases like single-point gaps and extreme values, and the ability to analyze time and space complexity.
Coding & AlgorithmsOnsite - AmazonHardSoftware EngineerMerge two sorted arrays in-place
This problem tests your ability to manipulate arrays in-place while managing constraints to avoid unnecessary data movement or auxiliary space usage.
Coding & AlgorithmsTechnical ScreenArraysTwo PointersIn-place - AmazonMediumSoftware EngineerMessage Rate Limiter
Design an in-memory message rate limiter that allows or denies messages based on whether a given time window has elapsed since their last accepted occurrence.
Coding & AlgorithmsOnsiteHash MapDesignRate Limiter - AmazonHardSoftware EngineerMinimize Branch Merge Conflicts
This question evaluates understanding of combinatorial optimization, set operations, and order-dependent state management, requiring reasoning about how commit file modifications accumulate across branch merges.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerMinimize Circular Redistribution Cost
This problem tests your ability to handle circular array indexing and perform efficient redistributions using modulo arithmetic and prefix sum concepts.
Coding & AlgorithmsOnline AssessmentArraysModuloOptimization - AmazonMediumSoftware EngineerMinimize Global Replacements to Make Values Contiguous
Determine the minimum number of global value replacements needed so that every remaining value in an array forms a single contiguous block.
Coding & AlgorithmsOnline Assessmentintervalsgreedyhash-table - AmazonMediumSoftware EngineerMinimize Grid Inconvenience by Adding One Delivery Center
Add at most one delivery center to minimize the maximum Chebyshev distance from ordinary grid cells to their nearest center.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerMinimize Points Used Across Multiple Reward Programs
Minimize the number of indivisible reward points needed to meet or exceed a microdollar target across programs with different values and finite balances, returning failure when coverage is impossible.
Coding & AlgorithmsTechnical Screen - AmazonHardSoftware EngineerMinimize Replacements So Equal Product Values Are Contiguous
This problem tests your ability to optimize data transformations by identifying contiguous blocks of identical values, modeled as a shortest-path or dynamic programming problem on a compressed representation of the array.
Coding & AlgorithmsOnsiteGreedyDynamic ProgrammingData Structures - AmazonHardSoftware EngineerMinimize operations to reduce price difference
This question evaluates algorithm design and array-manipulation skills, focusing on reasoning about constrained transfers of value, invariants, and the minimization of operation counts under a fixed per-operation bound.
Coding & AlgorithmsOnline Assessment - AmazonHardSoftware EngineerMinimize time for two handlers
This problem tests your ability to use dynamic programming or greedy strategies with state tracking to minimize the total completion time of tasks assigned to two distinct handlers.
Coding & AlgorithmsOnline AssessmentDynamic ProgrammingOptimizationGreedy - AmazonMediumSoftware EngineerMinimum Bills and Coins to Make Change
This problem tests your ability to determine the optimal combination of coins and bills to achieve a specific target amount, while managing limited inventory and precision issues.
Coding & AlgorithmsTechnical ScreenGreedyDynamic ProgrammingArithmetic - AmazonMediumSoftware EngineerMinimum Drone Delivery Time on a Ring of Hubs
This problem tests your ability to calculate optimal traversal distances on a circular path, requiring the application of modular arithmetic and greedy logic to minimize movement between sequential points.
Coding & AlgorithmsTechnical ScreenAlgorithmsGreedyModular Arithmetic - AmazonMediumSoftware EngineerMinimum Moves for a Squirrel to Carry Every Nut to a Tree One at a Time
A squirrel on an obstacle-free grid must carry every nut to a tree, holding at most one nut at a time and moving one cell per step. The task asks for the minimum total number of moves over all delivery orders, testing reasoning about grid distances and how the order of deliveries affects the total.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerMinimum Path Length Through a Grid With One Allowed Cell Conversion
This problem tests your ability to adapt BFS to a state-space graph where an additional dimension represents the remaining capacity to modify the grid, requiring efficient state tracking to find the shortest path.
Coding & AlgorithmsOnline AssessmentBFSGraphShortest Path - AmazonHardSoftware EngineerMinimum Priority Conflicts When Interleaving Two Lowercase Strings
From an Amazon online assessment: merge two lowercase strings into one while keeping each string's internal order, where smaller letters have higher priority and every lower-priority letter placed before a higher-priority one counts as a conflict. Return the minimum possible number of conflicts over all valid merges.
Coding & AlgorithmsOnline Assessment
Amazon