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 91–120 of 2629 results
- AmazonMediumSoftware EngineerCompute fruit spoilage time in a grid
This question evaluates a candidate's understanding of graph traversal concepts, grid-based state propagation, and reachability analysis in time-evolving systems.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerCompute maximum distinct-product pickup days
This question evaluates a candidate's understanding of greedy and resource-allocation strategies along with combinatorial reasoning to maximize operations under discrete constraints.
Coding & AlgorithmsOnline Assessment - AmazonEasySoftware EngineerCompute minimal operations and optimal server pairing
This two-part question evaluates array manipulation and optimization skills—specifically range-update minimization to enforce a nondecreasing sequence and greedy pairing/matching to maximize summed primary resources—testing algorithm design, complexity reasoning, and constraint handling.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerCompute optimal locker placement with obstacles
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Compute optimal locker placement with obstacles states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerCompute peak parking lot occupancy intervals
This question evaluates a candidate's competency in temporal interval reasoning, event-stream processing, and handling incomplete or unsorted logs to determine peak concurrent occupancy.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerCompute product excluding index without division
This question evaluates array-manipulation and algorithmic problem-solving skills, focusing on computing a product-for-each-index using prefix and postfix accumulation concepts while reasoning about edge cases such as zeros, negative numbers, and integer overflow.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerCompute reachability and minimal-time same-type scheduling
This prompt evaluates integer reachability and invariant reasoning via repeated additive transformations (testing number-theoretic reachability and state-space analysis) alongside resource-aware scheduling and grouping logic for minimizing completion time under type and memory constraints, and it falls under the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerCompute shortest path with obstacles
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Compute shortest path with obstacles states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerCompute the Median After Each Stream Insertion
This problem tests your ability to maintain dynamic statistics in a data stream using efficient data structures to achieve logarithmic insertion and constant-time retrieval.
Coding & AlgorithmsOnsiteHeapsData StreamsSorting - AmazonEasySoftware EngineerCompute the Minimum Number of Meeting Rooms
This problem tests your ability to manage overlapping time intervals efficiently, requiring an understanding of sorting or priority queues to track resource utilization.
Coding & AlgorithmsTechnical ScreenSortingIntervalsGreedy - AmazonMediumSoftware EngineerCompute total revenue from greedy VM rentals
This problem tests your ability to use greedy strategies combined with efficient data structures to manage resource allocation and optimize revenue based on priority-based demand.
Coding & AlgorithmsTechnical ScreenGreedyData StructuresHeap - AmazonMediumSoftware EngineerCompute tree diameter
This question evaluates understanding of binary tree algorithms, recursion versus iterative traversal strategies, and competence in algorithmic analysis including time and space complexity and handling deep-recursion stack overflow when computing a tree's diameter.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerCount Connected Components in an Undirected Graph
This question tests the ability to traverse an undirected graph using graph search algorithms to identify and count disjoint subgraphs.
Coding & AlgorithmsTechnical ScreenGraphsBFSDFS - AmazonMediumSoftware EngineerCount Customers Who Visited on Multiple Dates
Tests data manipulation, hash set/map aggregation, and date deduplication to identify users with repeat visits across distinct calendar days.
Coding & AlgorithmsTechnical ScreenHash TableCountingString - AmazonMediumSoftware EngineerCount Four-Neighbor Islands in a Binary Matrix
Count four-neighbor islands in a binary matrix and consider the connectivity state needed when rows arrive as a stream.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerCount expressions reaching a target sum
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Count expressions reaching a target sum states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerCount partitions and equal-cost packages
This question evaluates string-processing and combinatorial counting skills, including tracking distinct-character occurrences across contiguous partitions and using frequency-based pairing logic on arrays to form equal-cost packages.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerCount regions with DFS
This question evaluates proficiency in graph traversal and grid-based connected-component detection using depth-first search on a binary m x n grid, along with algorithmic complexity analysis and techniques to avoid revisiting cells.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerCount the Distinct Binary Search Tree Shapes for Keys 1 to n
Count how many structurally different binary search trees can store the keys 1 through n exactly once, for n up to 19. It tests reasoning about how tree shapes decompose and counting combinatorial structures efficiently instead of building every tree.
Coding & AlgorithmsOther - AmazonHardSoftware EngineerCount unique Morse-code word transformations
This question evaluates a candidate's ability to implement string transformations based on a fixed character-to-code mapping and to identify distinct results, testing competencies in encoding, string manipulation, and deduplication.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerCourse Prerequisite Feasibility
This question tests the ability to detect cycles in a directed graph to determine if a set of academic courses with prerequisite constraints can be completed.
Coding & AlgorithmsTechnical ScreenGraphDFSTopological Sort - AmazonMediumSoftware EngineerCreate a Binary Tree from Parent-Child Descriptions
Construct one valid binary tree from unordered parent-child descriptions that identify left and right links. Reuse node identities across records, support children appearing before parents, and return the unique root.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerDesign 2D DP on a DAG
Design 2D DP on a DAG 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 EngineerDesign LCA with flexible inputs and rule
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Design LCA with flexible inputs and rule states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerDesign a fixed-capacity circular queue
This question evaluates understanding of fixed-capacity circular queue data structures, array-based indexing, modular arithmetic, and the requirement for constant-time (O(1)) enqueue/dequeue operations.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerDesign a hierarchical locking tree
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Design a hierarchical locking tree states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerDesign a no-repeat top-frequency music player
Design a no-repeat frequency-based music player with addUserSongs and getNextSong APIs. Covers max-heap data structures, lazy deletion, cycle resets, mid-cycle song additions, and complexity.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerDesign a weighted random value generator
This problem tests your ability to implement efficient weighted random selection using prefix sums and binary search, and handling state updates.
Coding & AlgorithmsTechnical ScreenBinary SearchHash MapProbability - AmazonMediumSoftware EngineerDesign faster delay-time computation
This question evaluates a candidate's ability to design efficient array algorithms and appropriate data structures for nearest-smaller-element queries, assessing performance, correctness with duplicates, and scalability to large inputs.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerDesign rolling-window top-K click tracker
Design rolling-window top-K click tracker 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 & AlgorithmsOnsite
Amazon