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 421–450 of 2810 results

  • AppleMediumSoftware Engineer
    Time-to-Live Token Manager With Renewal and a Heavy Concurrent Read/Write Follow-up

    Implement a token manager in which each token expires a fixed time-to-live after it is generated or renewed, renewals extend only unexpired tokens, and a query counts live tokens. The follow-up asks how to keep it correct and fast under heavy concurrent reads and writes.

    Software Engineering FundamentalsTechnical Screen
  • AppleMediumSoftware Engineer
    Troubleshoot a Failing Kubernetes Pod: Where to Start and What to Check

    Explain how to troubleshoot a Kubernetes pod that has a problem, starting from its status, container states and events. Tests mapping Pending, ImagePullBackOff, CrashLoopBackOff, OOMKilled and not-Ready states to likely causes, using logs, debug containers and node checks, and separating mitigation from root cause.

    Software Engineering FundamentalsTechnical Screen
  • AppleMediumSoftware Engineer
    Unit Ratio Queries Across Independent Unit Families with Modular Answers

    A graph coding problem: given multiplicative conversion factors between units that split into independent families, answer queries for how many units of one unit equal one unit of another, returning the ratio modulo a prime or -1 when the units cannot be converted. It tests graph traversal over a forest and modular arithmetic.

    Coding & AlgorithmsTechnical Screen
  • AppleEasySoftware Engineer
    Write a Usage Example for a Resource-Owning C++ Class and Explain Its Semantics

    A C++ internship screen exercise: read an unfamiliar class that owns a heap array and write an example program showing callers how to use it correctly. It tests code comprehension and C++ fundamentals such as RAII, deleted copy operations, move semantics, noexcept, explicit constructors and const-correctness.

    Software Engineering FundamentalsTechnical Screen
  • AppleMediumSoftware Engineer
    Zero out duplicates and sort an array

    This question evaluates proficiency in array manipulation, duplicate handling, and custom sorting logic with attention to time and space complexity, and it falls within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • Applied IntuitionMediumSoftware Engineer
    Design Parsing Boundaries for Interdependent Message Types

    Design parsing and type-resolution boundaries for interdependent message definitions, clarifying schema versus encoded input, forward references, recursion, and validation.

    Software Engineering FundamentalsTechnical Screen
  • Applied IntuitionMediumSoftware Engineer
    Design Sensor Data Processing With AI-Assisted Implementation

    Design an end-to-end ingestion, validation, and storage pipeline for high-frequency sensor telemetry from autonomous vehicle fleets. The focus is on handling raw versus derived data, schema modeling, fast time-range queries, and robust validation.

    System DesignTechnical ScreenTime SeriesData PipelineIoT & Robotics
  • Applied IntuitionMediumSoftware Engineer
    Design a C++ Ring Buffer for Producer-Consumer Use

    This problem tests your understanding of multi-threaded synchronization primitives, memory ordering, and circular buffer logic in a low-latency environment.

    Software Engineering FundamentalsTechnical ScreenC++ConcurrencyLock-free
  • Applied IntuitionMediumSoftware Engineer
    Design a Streaming TLV Message Reassembler in C

    Implement an in-memory reassembler in C that reconstructs out-of-order chunked TLV messages, validates chunk bounds and duplicates, and detects message completion.

    Software Engineering FundamentalsTechnical ScreenCSystems ProgrammingNetworking
  • Applied IntuitionMediumSoftware Engineer
    Design a Transactional Key-Value Store

    This problem tests the ability to design an in-memory key-value store that supports nested transactions, including atomic commits, rollbacks, and precise state management across layers.

    Software Engineering FundamentalsTechnical ScreenData StructuresSystem DesignTransactions
  • Applied IntuitionMediumSoftware Engineer
    Design a transactional in-memory key–value store

    This question evaluates understanding of transactional state management, nested transaction semantics, scope shadowing, and efficient data-structure design for an in-memory key–value store, assessing competency in correctness, consistency, and algorithmic complexity under nested BEGIN/ROLLBACK/COMMIT operations.

    Coding & AlgorithmsTechnical Screen
  • Applied IntuitionHardSoftware Engineer
    Discuss productionizing event-timeout detector

    Discuss productionizing event-timeout detector evaluates requirements, scale assumptions, API/data design, architecture, trade-offs, failure modes, and rollout in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    System DesignTechnical Screen
  • Applied IntuitionMediumSoftware Engineer
    Evaluate Dependent Variable Assignments

    Evaluate a list of variable assignment statements where variable values can depend on variables defined later in the input. The problem tests expression parsing, cycle detection, dependency resolution via topological ordering or memoized depth-first search, and deep recursion handling.

    Coding & AlgorithmsTechnical Screengraphtopological-sortparsing
  • Applied IntuitionEasySoftware Engineer
    Evaluate variables in simple arithmetic DSL

    This question evaluates implementation skills in parsing and evaluating a small arithmetic DSL, covering variable assignment parsing, symbol resolution, and evaluation order; it falls under the Coding & Algorithms category and emphasizes practical application and engineering of a correct evaluator rather than abstract theory.

    Coding & AlgorithmsTechnical Screen
  • Applied IntuitionMediumSoftware Engineer
    Explain motivation and background

    This interview question evaluates behavioral evidence, ownership, communication, trade-offs, and measurable outcomes in a realistic interview setting. A strong answer for Explain motivation and background states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Behavioral & LeadershipTechnical Screen
  • Applied IntuitionMediumSoftware Engineer
    Find duplicate files by size

    This question evaluates file parsing, data deduplication and grouping skills along with algorithmic efficiency and space-time trade-offs when identifying duplicate files by size rather than by content.

    Coding & AlgorithmsTechnical Screen
  • Applied IntuitionMediumSoftware Engineer
    Find first and last occurrence in sorted array

    This question tests the ability to modify the standard binary search algorithm to achieve logarithmic time complexity when searching for the boundary indices of a target value in a sorted array.

    Coding & AlgorithmsTechnical ScreenBinary SearchArrayAlgorithms
  • Applied IntuitionMediumSoftware Engineer
    Find grid cell minimizing sum distances

    This question evaluates proficiency in grid-based graph traversal and shortest-path computation using BFS, reachability analysis from multiple marked points, and algorithmic time/space complexity reasoning.

    Coding & AlgorithmsTechnical Screen
  • Applied IntuitionMediumSoftware Engineer
    Locate Cars with a Boolean Square-Scan API

    Implement and analyze a quadtree-based search algorithm that locates all vehicles on a 2D grid using a Boolean square-scan API.

    Software Engineering FundamentalsTechnical Screenrecursiondivide-and-conquerquadtree
  • Applied IntuitionHardSoftware Engineer
    Merge Overlapping Collinear Lane Segments Given as Integer Point Lists

    Merge straight lane segments, each given as a list of collinear integer points, so that segments lying on the same line whose extents overlap or touch become one segment containing all of their points. It tests exact collinearity checks, handling of horizontal and vertical segments, and interval merging along each line.

    Coding & AlgorithmsTechnical Screen
  • Applied IntuitionHardSoftware Engineer
    Merge Overlapping Collinear Segments

    This question evaluates computational geometry and algorithm design skills, focusing on collinearity testing, projecting points onto a line, merging overlapping 1D intervals generalized to arbitrary lines, ordering points along a line, and handling duplicates and edge cases.

    Coding & AlgorithmsTechnical Screen
  • Applied IntuitionHardSoftware Engineer
    Merge Overlapping Straight Fence Runs From a Property Survey

    Collapse a pile of straight fence-line survey readings into one run per physically continuous stretch of fence, by detecting which readings sit on the same infinite line and connect up. Tests exact collinearity detection, correct handling of every orientation, and interval merging per line.

    Coding & AlgorithmsTechnical Screengeometryunion-findsorting
  • Applied IntuitionMediumSoftware Engineer
    Merge collinear overlapping 2D segments

    This problem tests your ability to handle geometric data by identifying and merging overlapping segments that lie on the same infinite line.

    Coding & AlgorithmsTechnical ScreenGeometryIntervalsSorting
  • Applied IntuitionMediumSoftware Engineer
    Merge overlapping 2D line segments

    This problem tests your ability to handle geometric data by sorting and merging 1D intervals that exist within a 2D space, specifically focusing on collinear segments.

    Coding & AlgorithmsTechnical ScreenGeometrySortingIntervals
  • Applied IntuitionMediumSoftware Engineer
    Multi-Agent Collision Simulator (Unicycle Kinematics)

    Implement a discrete-time multi-agent simulator using unicycle kinematics and forward Euler integration to track agent trajectories and detect inter-agent collisions.

    Coding & AlgorithmsTechnical ScreenRoboticsSimulationGeometry
  • Applied IntuitionMediumSoftware Engineer
    Parse a protobuf-like schema and answer queries

    This problem tests your ability to parse a hierarchical schema definition, resolve nested type references using a symbol table, and implement an efficient lookup function for type paths.

    Coding & AlgorithmsTechnical ScreenParsingTrieHash Table
  • Applied IntuitionMediumSoftware Engineer
    Protobuf-Style Schema: Look Up Message Sizes and Field Types, Then Parse the Schema

    Implement size and field-type lookups over a simplified protobuf-style schema in which messages embed other messages, then write the parser that builds the schema from raw text. Tests schema data modeling, handling of nested, cyclic and unknown message references, clear error behavior, and robust parsing of proto-like definitions.

    Software Engineering FundamentalsTechnical Screen
  • Applied IntuitionMediumSoftware Engineer
    Scale Game of Life to huge matrices

    This question tests the ability to optimize grid-based simulations that exceed local memory capacity, focusing on sliding windows, buffer management, and efficient disk I/O.

    Coding & AlgorithmsTechnical ScreenAlgorithmsSystem-DesignI/O-Optimization
  • Applied IntuitionHardSoftware Engineer
    Scale a Grid Fire-Spread Simulation Past What Fits in Memory

    Scale a working small-grid cellular-automaton fire-spread simulation to a dense multi-million-cell board that no longer fits in memory, by computing each generation with a three-row sliding window read from one file and streamed into another. Tests memory estimation and disk-backed algorithm redesign without changing the core update rule.

    Software Engineering FundamentalsTechnical Screensimulationstreamingfile-io
  • Applied IntuitionHardSoftware Engineer
    Track simulations and report timeouts

    This question evaluates competency in algorithms and data-structure design for real-time stream processing, including maintaining per-simulation state, handling time-based expirations, and reasoning about performance and correctness.

    Coding & AlgorithmsTechnical Screen