Katkat

practice a little every day, paws crossed ♡

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 1381–1410 of 9403 results

  • 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 IntuitionHardSoftware Engineer
    Design a job scheduler

    This question evaluates competency in designing scalable, durable distributed job schedulers, covering multi-tenant architecture, queuing and metadata persistence, execution semantics, idempotency, retries/dead-lettering, failure handling, and observability.

    System DesignOnsite
  • Applied IntuitionEasySoftware Engineer
    Design a mini compiler/interpreter

    This question evaluates understanding of language design and implementation skills, including lexical analysis, parsing into an AST, expression evaluation with operator precedence and unary operators, variable assignment semantics, and runtime error reporting.

    Software Engineering FundamentalsOnsite
  • Applied IntuitionMediumSoftware Engineer
    Design a nested transaction store

    This question evaluates understanding of transactional state management, nested transaction semantics, scope resolution, and data-structure design for an in-memory key–value store.

    Coding & AlgorithmsOnsite
  • Applied IntuitionMediumSoftware Engineer
    Design a real-time 3D playback system for recorded vehicle logs

    Design a system that plays recorded vehicle log data back as a smooth, seekable 3D scene without downloading the whole log first. It tests chunked, time-indexed streaming, prefetching and caching around the playhead, aligning data streams of different rates, and handling heavy sensor data at scale.

    System DesignOnsite
  • Applied IntuitionMediumSoftware Engineer
    Design a simulator to replay left-turn videos

    This question assesses the ability to architect a high-throughput simulation system capable of retrieving, syncing, and replaying synchronized sensor data streams for autonomous vehicle testing.

    System DesignOnsiteData StreamingStorage OptimizationLatency
  • 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
    Explain potential reason for PIP risk

    This question evaluates a candidate's self-assessment, accountability, communication, and early risk-identification competencies in the context of individual performance and team dynamics for a Software Engineer role within the Behavioral & Leadership domain.

    Behavioral & LeadershipOnsite
  • 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 IntuitionEasySoftware Engineer
    Find intersection of two line segments

    This question evaluates a candidate's skills in computational geometry and numerical robustness, focusing on line-segment intersection reasoning, endpoint touching, collinearity, and precision handling.

    Coding & AlgorithmsOnsite
  • Applied IntuitionEasySoftware Engineer
    Group duplicate files by content

    This question evaluates understanding of file deduplication, efficient I/O and hashing strategies, streaming large-file processing, and scalable algorithm design for identifying files with identical byte-for-byte contents.

    Coding & AlgorithmsOnsite
  • Applied IntuitionMediumMachine Learning Engineer
    Implement a Fixed-Capacity Deque

    This question evaluates proficiency with double-ended queue semantics, fixed-capacity data structure design, constant-time (O(1)) operations, and correct handling of boundary conditions and wraparound.

    Coding & AlgorithmsTechnical Screen
  • Applied IntuitionMediumSoftware Engineer
    Implement a fixed-capacity generic circular buffer

    This question tests the ability to implement a space-efficient data structure using fixed-size arrays, modular arithmetic for index wrapping, and generic type constraints.

    Coding & AlgorithmsOnsiteData StructuresArraysGenerics
  • Applied IntuitionMediumSoftware Engineer
    Implement a nested object validator

    This question evaluates proficiency in nested data validation, schema interpretation, and type checking for hierarchical objects, including handling nulls, arrays, extra fields, and clear error reporting.

    Data Manipulation (SQL/Python)Onsite
  • Applied IntuitionMediumSoftware Engineer
    Implement a single-thread task scheduler API

    This problem tests your ability to design a priority-based scheduler using a min-heap to manage tasks triggered by relative or absolute timestamps, ensuring execution occurs in the correct temporal order.

    Coding & AlgorithmsOnsiteData StructuresPriority QueueAlgorithms
  • Applied IntuitionMediumMachine Learning Engineer
    Implement and explain positional encoding

    This question evaluates knowledge of positional encoding mechanisms for Transformer language models, covering embedding mathematics, tensor shapes and broadcasting, PyTorch implementation details, expected training and inference symptoms when positional information is omitted, and methods for empirical verification and ablation.

    Machine LearningTechnical 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