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 151–180 of 2629 results

  • AmazonMediumSoftware Engineer
    Find shortest subarray to restore order

    This question evaluates array manipulation and algorithmic problem-solving skills, focusing on understanding how local subarray sorting affects global order, edge-case reasoning (already-sorted arrays, duplicates, strictly decreasing sequences), and complexity analysis within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • AmazonHardSoftware Engineer
    Find the Closest Version by Date

    This problem tests your ability to efficiently search through chronologically ordered records and handle binary search logic with custom comparison rules.

    Coding & AlgorithmsOnsiteBinary SearchArraysAlgorithms
  • AmazonEasySoftware Engineer
    Find the Earliest Pair with a Target Sum

    Tests array traversal and hash table lookups to find a two-sum pair that minimizes the second index, running in linear time and space.

    Coding & AlgorithmsTechnical Screenarrayhash-tabletwo-sum
  • AmazonMediumSoftware Engineer
    Find the K Most Frequent Values

    Find any valid set of the k most frequent distinct integers, handling boundary ties with frequency counting, bounded heaps, or frequency buckets.

    Coding & AlgorithmsOnline Assessment
  • AmazonMediumSoftware Engineer
    Find the K-th Smallest Value in Two Sorted Arrays

    Given two nondecreasing integer arrays and a one-based integer k, return the k-th smallest value in their combined multiset. Work through the function contract, boundary cases, correctness argument, and time and space complexity expected in a production-quality solution.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Find the Kth Smallest Value in a Binary Search Tree

    Deserialize a level-order serialized binary search tree and find its kth smallest element using an efficient in-order traversal.

    Coding & AlgorithmsOnsitebinary-search-treetree-traversalstack
  • AmazonHardSoftware Engineer
    Find the Largest Rating Threshold Supported by K Instances

    Find the largest k for which at least k instance ratings are at least k, handling threshold equality and the zero-answer case.

    Coding & AlgorithmsOnline Assessment
  • AmazonEasySoftware Engineer
    Find the Lowest Common Ancestor in a Binary Tree

    This problem tests tree traversal techniques and recursive logic to identify the deepest node that is an ancestor to two specified nodes within a binary tree.

    Coding & AlgorithmsTechnical ScreenBinary TreeRecursionDFS
  • AmazonMediumSoftware Engineer
    Find the Maximum Island Area

    Find the largest four-neighbor island area in a binary matrix, including the component-size challenges of row-by-row streaming.

    Coding & AlgorithmsOnline Assessment
  • AmazonMediumSoftware Engineer
    Find the Minimum Processing Rate to Meet a Deadline

    This problem tests the ability to determine a minimum threshold using binary search on the answer space, combined with modular arithmetic and ceiling division.

    Coding & AlgorithmsOnsiteBinary SearchMathOptimization
  • AmazonHardSoftware Engineer
    Find the Most Common Visit Pattern

    This problem tests your ability to process chronological event data to identify the most frequent 3-step sequence, requiring efficient data structures to handle large volumes of user logs.

    Coding & AlgorithmsOnsiteHash MapSortingSliding Window
  • AmazonMediumSoftware Engineer
    Find the Most Frequent Request IDs

    Implement an algorithm to identify the top k most frequent request IDs from a stream of log events, breaking frequency ties by smaller ID values and handling cases where k exceeds the number of unique IDs.

    Coding & AlgorithmsOnsitehash-tableheapsorting
  • AmazonEasySoftware Engineer
    Find the Most Frequently Used Meeting Room

    Simulate meeting room assignments with delayed starts and duration preservation using priority queues to find the most utilized room.

    Coding & AlgorithmsTechnical ScreenHeapSimulationGreedy
  • AmazonEasySoftware Engineer
    Find the Single Value in a Sorted Array of Pairs

    This problem tests the ability to optimize a linear search into a logarithmic one by leveraging the properties of sorted pairs using binary search.

    Coding & AlgorithmsTechnical ScreenBinary SearchArraysDivide and Conquer
  • AmazonMediumSoftware Engineer
    Find top-k lottery winners by spending

    This problem tests the ability to manage top-k selection from a stream or static collection using heap data structures while enforcing deterministic tie-breaking rules.

    Coding & AlgorithmsTechnical ScreenHeapsSortingAlgorithms
  • AmazonMediumSoftware Engineer
    Find when failures started in log stream

    This problem tests the ability to identify the first occurrence of a specific condition in a sorted boolean stream using a modified binary search approach.

    Coding & AlgorithmsTechnical ScreenBinary SearchAlgorithmsOptimization
  • AmazonMediumSoftware Engineer
    Frequency Stack with Recency Tie-Breaking

    Design a frequency stack data structure that supports pushing elements and popping the most frequent element, breaking ties by choosing the most recently pushed element, with both operations running in O(1) time.

    Coding & AlgorithmsTechnical Screenstackhash-tabledesign
  • AmazonMediumSoftware Engineer
    Group Anagrams Without Sorted Character Signatures

    Group anagrams without sorting each word's characters, preserving repeated words and reasoning about frequency signatures and overflow-prone encodings.

    Coding & AlgorithmsOnline Assessment
  • 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
  • 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 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