practice a little every day, paws crossed ♡
Software Engineer 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 181–210 of 2629 results
- AmazonMediumSoftware EngineerImplement ad matching and delivery routing
Implement ad matching and delivery routing evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerImplement and Analyze an LRU Query Cache
Implement a fixed-capacity least-recently-used cache for integer query results with expected constant-time get and put operations. Refresh recency on hits and updates, evict the correct key on overflow, and handle misses and duplicate puts precisely.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerImplement basic calculator
This question evaluates skill in parsing and evaluating arithmetic expressions with integer operands and the operators +, -, *, and /, focusing on operator precedence and evaluation order within the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerImplement robust debounce and throttle in JavaScript
This question evaluates a developer's ability to implement debounce and throttle utilities in JavaScript, testing competencies in asynchronous timing, timer management, cancellation/flush semantics, error propagation, and handling edge cases such as rapid bursts, timer drift, and re-entrancy.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerImplement tree left/right views via BFS and DFS
This question evaluates understanding of binary tree traversal techniques and algorithmic reasoning for producing per-depth left and right views, assessing competencies in data structures, traversal ordering, and correctness across edge cases.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerImplement two array-cost minimization algorithms
This question evaluates algorithm design, data structure selection, and complexity analysis by requiring implementations for minimizing total merge cost and for removing a contiguous block to minimize the sum of adjacent absolute differences.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerInventory Allocation by Bid Priority
Implement a tiered inventory allocation system that distributes limited stock among buyer bids based on price tiers and round-robin priority rules.
Coding & AlgorithmsOnline AssessmentSimulationSortingGreedy - AmazonMediumSoftware EngineerJukebox That Plays the Most-Requested Song First
Design a request queue where each play takes the song with the most pending requests, with ties going to the most recent request. Tests keeping frequency and recency together so both operations run in O(1).
Coding & AlgorithmsOnsitedesignhash-mapstack - AmazonMediumSoftware EngineerJustify choosing JavaScript for interviews
This question evaluates a candidate's ability to articulate programming language trade-offs, understand language-specific runtime behaviors (types, hoisting, closures), and justify tool choice for front-end coding tasks within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerKth Largest Perfect Binary Subtree
This problem tests tree traversal techniques, the ability to validate binary tree properties recursively, and the use of selection algorithms to find order statistics.
Coding & AlgorithmsOnsiteTreesRecursionSorting - AmazonMediumSoftware EngineerLeaf Domain Cumulative Scores
This problem tests your ability to model hierarchical data using tree traversal and string manipulation to aggregate cumulative metrics across nested domains.
Coding & AlgorithmsOnsiteHash MapString ManipulationTree Traversal - AmazonHardSoftware EngineerLowest Common Ancestor in a Binary Search Tree
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.
Coding & AlgorithmsTechnical ScreenBinary Search TreeTreeBreadth-First Search - AmazonMediumSoftware EngineerMax total of k consecutive bags over disjoint valued segments, modulo 1e9+7
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.
Coding & AlgorithmsOnline Assessment - AmazonHardSoftware EngineerMaximize Money in K Consecutive Bags
This problem tests your ability to efficiently manage interval operations and sliding window logic on a sparse coordinate system.
Coding & AlgorithmsTechnical ScreenSliding WindowSortingTwo Pointers - AmazonMediumSoftware EngineerMaximize Value Under a Budget
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.
Coding & AlgorithmsTechnical ScreenDynamic ProgrammingOptimizationAlgorithms - AmazonMediumSoftware EngineerMaximize capacity with primary-backup pairing
This problem tests your ability to optimize resource pairing using greedy strategies or sorting to maximize total capacity under specific pair-wise constraints.
Coding & AlgorithmsOnline AssessmentGreedySortingOptimization - AmazonMediumSoftware EngineerMaximize credits with limited skips
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.
Coding & AlgorithmsOnline Assessment - 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 - 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 - 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 - 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
Amazon