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 451–480 of 5874 results

  • AmazonMediumSoftware Engineer
    Highest-total path through a binary tree encoded in level order

    A coding problem that asks for the largest sum of any non-empty path in a binary tree given in level order, where a path may bend at one node and need not include the root or a leaf. It tests recursive reasoning over trees, correct handling of negative values, and careful decoding of the input format.

    Coding & AlgorithmsOther
  • AmazonMediumSoftware Engineer
    Implement Cache and Count Components

    This question evaluates a candidate's ability to design and implement efficient data structures for constant-time operations and to reason about graph connectivity and component counting, falling under the Coding & Algorithms domain and requiring practical implementation with algorithmic complexity reasoning.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Implement Cache and Rotate Matrix

    This two-part question evaluates competency in data structure design and in-place array manipulation, specifically the ability to implement an LRU cache with O(1)-average operations (including recency management, updates, and evictions) and to rotate an n x n matrix 90 degrees clockwise in place without extra space.

    Coding & AlgorithmsOnsite
  • AmazonHardSoftware Engineer
    Implement Datacenter Router Commands

    This problem tests your ability to manage stateful data structures, perform geometric calculations (Haversine formula), and implement multi-level sorting logic to simulate router command processing.

    Coding & AlgorithmsTechnical ScreenData StructuresGeometryAlgorithms
  • AmazonMediumSoftware Engineer
    Implement Event Filtering and Queue Routing

    Implement an in-memory event routing engine that matches nested JSON events against subscriber filter policies and routes them in subscription order.

    Coding & AlgorithmsTechnical ScreenData StructuresJSON ParsingDesign
  • AmazonEasySoftware Engineer
    Implement Interview Coding Problems

    This question evaluates implementation and algorithmic skills across core data structures and array/interval algorithms, specifically hashing (hash map design including collision handling and resizing), interval merging and intersection logic, and array optimization problems such as maximum container area and trapped rainwater.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Implement LRU cache with O(1) ops

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Implement LRU cache with O(1) ops states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsOnsite
  • AmazonEasySoftware Engineer
    Implement Regular Expression Matching

    This problem tests your ability to handle recursive string matching problems using dynamic programming, specifically focusing on handling wildcard and repetition operators.

    Coding & AlgorithmsTechnical ScreenDynamic ProgrammingStringsRecursion
  • AmazonMediumSoftware Engineer
    Implement Review Content Moderation

    This problem tests your ability to design a content moderation service that efficiently checks for prohibited words and maintains a running count of violations per user using a stateful metadata store.

    Software Engineering FundamentalsOnline AssessmentHash MapsData StructuresState Management
  • AmazonHardSoftware Engineer
    Implement a Half-Open Interval Range Module

    This problem tests proficiency with balanced binary search trees or interval management techniques to efficiently track and manipulate sets of half-open intervals.

    Coding & AlgorithmsTechnical ScreenIntervalsBinary SearchData Structures
  • AmazonMediumSoftware Engineer
    Implement a Min-Priority Queue Without a Library Heap

    Tests implementation of a binary min-heap from scratch, including array-based representation, sift-up, and sift-down operations, without relying on built-in priority queue libraries.

    Coding & AlgorithmsOnsiteHeapData StructuresDesign
  • AmazonMediumSoftware Engineer
    Implement a Single-Node Priority Pub/Sub

    This question evaluates understanding of concurrent system design, in-memory publish–subscribe semantics, prioritized delivery ordering, API and data structure selection, and thread-safety within the Software Engineering Fundamentals domain.

    Software Engineering FundamentalsOnsite
  • AmazonMediumSoftware Engineer
    Implement a formatted shell script output

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Implement a formatted shell script output states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Implement a robust shell CLI

    This question evaluates proficiency in POSIX-compliant shell scripting, including positional argument parsing and validation, ISO 8601 UTC timestamp generation, file metadata extraction for license determination, construction of user@hostname, error handling and exit-code semantics, and handling of non-ASCII file paths.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Implement 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 Engineer
    Implement 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 Engineer
    Implement 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 Engineer
    Implement 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 Engineer
    Implement 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 Engineer
    Implement 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 Engineer
    Improve an Inefficient Team Process

    This question assesses the candidate's ability to identify systemic bottlenecks, influence stakeholders through data, and implement sustainable process improvements while maintaining system stability.

    Behavioral & LeadershipTechnical ScreenBehavioralLeadershipProcess Improvement
  • AmazonMediumSoftware Engineer
    Influence a Colleague Who Prefers a Different Approach

    Describe influencing a colleague through shared goals, fair comparison, evidence, willingness to revise, and a concrete collaborative decision.

    Behavioral & LeadershipOnsite
  • AmazonMediumSoftware Engineer
    Inventory 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 Engineer
    Jukebox 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 Engineer
    Justify 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 Engineer
    Kth 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 Engineer
    Leadership Principle Stories: Ownership, Dive Deep, Tight Deadline, Disagree and Commit

    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.

    Behavioral & LeadershipOnsite
  • AmazonMediumSoftware Engineer
    Leaf 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
  • AmazonMediumSoftware Engineer
    Learn What You Need to Solve an Unfamiliar Problem

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

    Behavioral & LeadershipOnsite
  • AmazonHardSoftware Engineer
    Lowest 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