Katkat

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 241–270 of 2629 results

  • AmazonMediumSoftware Engineer
    Solve Rotting Oranges and Bus Walk Reachability

    This question evaluates graph and grid traversal skills, state modeling over time, and constrained reachability combining free transit edges with Manhattan-distance walking.

    Coding & AlgorithmsOnsite
  • AmazonMediumSoftware Engineer
    Solve Shipping and Bundle-Cost Problems

    This problem tests your ability to determine the minimum capacity required to complete tasks within a deadline and optimize the cost of purchasing items grouped in bundles.

    Coding & AlgorithmsOnsiteBinary SearchDynamic ProgrammingOptimization
  • AmazonMediumSoftware Engineer
    Solve Three Algorithm Variants

    This multi-part question evaluates combinatorics and permutation generation, tree traversal and node-relationship classification, and array/sequence processing under bounded-gap constraints, measuring algorithmic design, complexity reasoning, and data-structure manipulation within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Solve Two OA Algorithm Problems

    These two problems evaluate proficiency with greedy algorithms, array manipulation, simulation of stateful processes, and feasibility analysis under capacity constraints.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Solve Union-Find, Graph, and Stream Problems

    This question evaluates understanding of disjoint-set (union-find) operations, directed graph processing including cycle detection and ordering, contiguous subarray sum reasoning, and online streaming/anagram detection techniques, emphasizing data structures and algorithmic problem-solving.

    Coding & AlgorithmsOnsite
  • AmazonMediumSoftware Engineer
    Solve array and list algorithms

    This question evaluates proficiency in array and list algorithms, including ordering and counting techniques for relative element ranking, merging multiple sorted inputs, and algorithmic design for a package locker retrieval operation, testing data structure manipulation and retrieval logic.

    Coding & AlgorithmsTechnical Screen
  • AmazonEasySoftware Engineer
    Solve array duplicates and two-type subarray

    This problem tests your ability to efficiently detect duplicates using hashing and to apply the sliding window technique to find subarrays that meet specific frequency constraints.

    Coding & AlgorithmsTechnical ScreenArraysHash TableSliding Window
  • AmazonMediumSoftware Engineer
    Solve jumps and anagram-similarity problems

    This two-part question evaluates algorithmic problem-solving skills: Task A focuses on combinatorial optimization and cost-based sequencing under quadratic jump costs, while Task B assesses string multiset reasoning and character-frequency manipulation to determine anagram similarity.

    Coding & AlgorithmsOnline Assessment
  • AmazonMediumSoftware Engineer
    Solve median extremes and segment flips

    Solve median extremes and segment flips 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 & AlgorithmsOnline Assessment
  • AmazonMediumSoftware Engineer
    Solve sliding-window and heap problems

    This question evaluates algorithm design and data structure proficiency, focusing on sliding-window techniques for fixed-length subarray aggregates and heap- or hashmap-based approaches for maintaining medians in a real-time integer stream, along with considerations for concurrent execution.

    Coding & AlgorithmsOnsite
  • AmazonMediumSoftware Engineer
    Solve string partition and equal-sum package problems

    Solve string partition and equal-sum package problems 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 & AlgorithmsOnline Assessment
  • AmazonMediumSoftware Engineer
    Solve three coding tasks: binary search, tree path, subarray

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Solve three coding tasks: binary search, tree path, subarray states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsOnsite
  • AmazonMediumSoftware Engineer
    Solve tree and DP problems

    This pair of problems evaluates proficiency with tree data structures and traversal concepts (deepest shared ancestor) and with dynamic programming/state optimization on linear arrays (maximizing non-adjacent house values), assessing algorithmic reasoning, complexity awareness, and data-structure manipulation.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Solve two set and graph problems

    This question evaluates proficiency in data-structure manipulation (set operations, mapping and deduplication), directed-graph modeling and traversal for reachability, and algorithmic time/space complexity analysis.

    Coding & AlgorithmsOnsite
  • AmazonMediumSoftware Engineer
    Spreadsheet Formulas with Dependency Updates

    Design a simplified in-memory spreadsheet supporting direct cell assignment, formula assignment (summation with potential duplicate cell references), and retrieval with dynamic dependency propagation.

    Coding & AlgorithmsOnsitegraphdesignhash-table
  • AmazonMediumSoftware Engineer
    Stack Whose Pop Removes the Most Frequent Value, Ties Broken by Recency

    Phone screen coding problem: process push and pop operations on a stack in which every pop removes the value that currently occurs most often, breaking ties by the tied value closest to the top. It tests designing a data structure that tracks frequency and recency together efficiently.

    Coding & AlgorithmsOnsite
  • AmazonMediumSoftware Engineer
    Track Missing Package IDs from Out-of-Order Receipts

    This problem tests the ability to track a range of sequential integers and identify gaps in a stream of incoming data using efficient data structures.

    Coding & AlgorithmsTechnical ScreenArraysHash TablesData Structures
  • AmazonMediumSoftware Engineer
    Track the Contiguous Package Frontier and Missing IDs

    This problem tests your ability to manage sparse, out-of-order data using data structures like sets or priority queues and finding gaps within a contiguous range.

    Coding & AlgorithmsTechnical ScreenData StructuresHashingArrays
  • AmazonEasySoftware Engineer
    Unify Stock-Trading Profit Variants

    This problem tests state-space dynamic programming by unifying different stock trading constraints (transaction limits and per-transaction fees) into a single optimized state-transition model.

    Coding & AlgorithmsTechnical ScreenDynamic ProgrammingState MachineOptimization
  • AmazonMediumSoftware Engineer
    Validate 9x9 grid in one pass

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Validate 9x9 grid in one pass states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsOnsite
  • AmazonEasySoftware Engineer
    Validate Properly Nested Brackets

    Tests understanding of basic data structures—specifically stacks—to validate balanced and nested bracket sequences in linear time.

    Coding & AlgorithmsTechnical Screenstackstringsdata-structures
  • AmazonMediumSoftware Engineer
    Validate a training courses catalog

    This problem tests your ability to model prerequisites as a directed graph and detect circular dependencies using cycle detection algorithms (Kahn's or DFS).

    Coding & AlgorithmsTechnical ScreenGraphTopological SortDFS
  • AmazonMediumSoftware Engineer
    Versioned Integer Array with Snapshots and Point-in-Time Reads

    A coding problem about a fixed-length integer array that supports point updates, numbered snapshots of the whole array, and reads of any position as of an earlier snapshot, processed as a list of operations. It tests designing a versioned data structure that stays fast and memory-efficient when snapshots are frequent.

    Coding & AlgorithmsOther
  • Ambience HealthcareMediumSoftware Engineer
    Design a least-recently-used cache

    Design a least-recently-used cache 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
  • AmericanMediumSoftware Engineer
    Cover the Most Points with an Axis-Aligned Rectangle of Bounded Perimeter

    Maximize point coverage with an axis-aligned rectangle under a perimeter budget, including boundary points and repeated coordinates.

    Coding & AlgorithmsOnline Assessment
  • AmericanMediumSoftware Engineer
    Spread Nine Stones Across a Three-by-Three Grid with Minimum Moves

    Calculate the minimum number of orthogonal moves needed to distribute stones so that every cell in a 3x3 grid contains exactly one stone.

    Coding & AlgorithmsOnline AssessmentBacktrackingRecursionMatrix
  • AmperityMediumSoftware Engineer
    Render Overlapping Rectangles on an ASCII Canvas

    Render bordered and filled rectangles onto a fixed ASCII canvas, clipping safely and honoring input-order overwrites. Handle negative coordinates, fully hidden shapes, one-cell dimensions, trailing spaces, overlap behavior, and a canvas of up to one million cells.

    Coding & AlgorithmsOnsite
  • AmplitudeMediumSoftware Engineer
    Implement Employee Validation and Snake

    This question evaluates recursion, graph traversal and cycle-detection concepts for hierarchical employee validation alongside state management, event-driven input handling and collision detection for a grid-based Snake game.

    Coding & AlgorithmsOnsite
  • AmplitudeMediumSoftware Engineer
    Swap kth-from-end node with head

    This question evaluates a candidate's understanding of singly linked list pointer manipulation, in-place node swapping with O(1) extra memory, and handling of edge cases such as when the k-th node from the end is the head.

    Coding & AlgorithmsTechnical Screen
  • Anchorage DigitalMediumSoftware Engineer
    Design a dynamic leaderboard with rank queries

    This question tests the ability to maintain a dynamic set of scores and efficiently query the rank of a user, requiring a balance between update complexity and retrieval time.

    Coding & AlgorithmsTechnical ScreenData StructuresOrder StatisticsTrees