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 661–690 of 3640 results

  • BloombergMediumSoftware Engineer
    Solve three coding tasks from onsite

    This problem tests your ability to handle three distinct algorithmic scenarios: greedy logic for circular traversal, stack-based syntax validation, and state-space exploration on a 2D grid.

    Coding & AlgorithmsOnsiteGreedyStackGraph Search
  • BloombergMediumSoftware Engineer
    Solve two array and string problems

    This two-part question evaluates combinatorial enumeration and subset-generation concepts for arrays alongside string parsing and parentheses-sequence validation for noisy input, measuring algorithm design, correctness, and complexity reasoning in array and string contexts.

    Coding & AlgorithmsOnsite
  • BnsfHardSoftware Engineer
    Maximize Valid Trains from Shared Equipment

    Form the maximum number of valid trains from a shared pool of locomotives and railcars, breaking ties by maximizing total railcar length.

    Coding & AlgorithmsOnsiteBitmask DPBacktrackingBranch and Bound
  • Booking.comMediumSoftware Engineer
    Design a Real-Time Logging System

    This question evaluates a candidate's competency in designing scalable, low-latency telemetry and logging systems, covering distributed systems architecture, ingestion pipelines, data modeling, real-time querying, reliability, backpressure, partitioning, indexing, retention, and operational trade-offs.

    System DesignOnsite
  • Booking.comMediumSoftware Engineer
    Match Bookings to Payments

    This question evaluates skill in matching records across unsorted collections, focusing on data structures, aggregation and handling one-to-one and one-to-many relationships between bookings and payments.

    Coding & AlgorithmsOnsite
  • BoxMediumSoftware Engineer
    Compute Top-K word frequencies under a path

    Compute Top-K word frequencies under a path 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 & AlgorithmsOnsite
  • BoxMediumSoftware Engineer
    Design out-of-order windowed stream processor

    Design out-of-order windowed stream processor 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 & AlgorithmsOnsite
  • BoxMediumSoftware Engineer
    Diagnose failures via SSH and large logs

    Diagnose failures via SSH and large logs 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 DesignOnsite
  • BoxHardSoftware Engineer
    Explain and diagram your past system architecture

    Explain and diagram your past system architecture 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 DesignOnsite
  • BoxMediumSoftware Engineer
    Flip a specific bit in an integer

    This question evaluates a candidate's understanding of bitwise operations and low-level integer manipulation, along with the ability to reason about the time and space complexity of bit-level operations.

    Coding & AlgorithmsOnsite
  • BoxMediumSoftware Engineer
    Identify and fix deadlock in locked code

    Identify and fix deadlock in locked code 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 DesignOnsite
  • BoxEasySoftware Engineer
    Implement a Leaky Bucket Rate Limiter

    This question evaluates understanding of rate-limiting algorithms, time-based state management, and concurrent programming concepts, including synchronization and test design for boundary and timing behaviors.

    Coding & AlgorithmsOnsite
  • BoxHardSoftware Engineer
    Implement a leaky-bucket rate limiter

    Implement a leaky-bucket rate limiter 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.

    Coding & AlgorithmsOnsite
  • BoxMediumSoftware Engineer
    Solve classic troubleshooting & algorithm tasks

    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 classic troubleshooting & algorithm tasks states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsOnsite
  • BrexMediumSoftware Engineer
    Build a Simplified Venmo-Style Peer-to-Peer Payments App with AI Tools

    An AI-assisted coding round prompt: build a simplified Venmo-style peer-to-peer payments app with users, balances, payments and transaction history, using any AI coding tool. It tests scoping a vague prompt, exact money handling, atomic and idempotent payments under concurrency, and the ability to review and explain generated code.

    Software Engineering FundamentalsOnsite
  • BrexMediumSoftware Engineer
    Design a Peer-to-Peer Money Transfer System

    Design a peer-to-peer money transfer product with accurate balances and history despite retries, crashes, and concurrent spending. Define APIs, transfer states, durable accounting, atomic movement, recovery, reconciliation, authorization, and the boundary between an in-memory prototype and production.

    System DesignOnsite
  • ByteDanceHardSoftware Engineer
    Add TTL to an LRU cache

    This question evaluates a candidate's understanding of cache design, LRU eviction policies, time-to-live (TTL) semantics, appropriate data structures, time complexity reasoning, and concurrency control.

    Software Engineering FundamentalsOnsite
  • ByteDanceMediumSoftware Engineer
    Build a validated add-sub calculator

    This question evaluates skills in string parsing, tokenization, input validation, and safe integer arithmetic handling, with emphasis on enforcing format rules such as operator placement, prevention of leading zeros, and 32-bit signed integer bounds.

    Coding & AlgorithmsOnsite
  • ByteDanceMediumData Engineer
    Connect Points With Minimum Total Distance

    This problem tests your ability to model a geometric optimization task as a Minimum Spanning Tree (MST) problem and implement it efficiently using Kruskal's or Prim's algorithm.

    Coding & AlgorithmsOnsiteGraphsMSTGeometry
  • ByteDanceHardMachine Learning Engineer
    Count Special Subarrays by Modular Frequency

    This question evaluates the ability to apply modular arithmetic, frequency tracking, and prefix-count reasoning to efficiently count subarrays that satisfy a congruence condition, testing algorithmic problem-solving and scalable complexity management.

    Coding & AlgorithmsOnsite
  • ByteDanceHardSoftware Engineer
    Course Schedule Feasibility

    This problem tests the ability to detect cycles in a directed graph using topological sorting or Depth First Search, ensuring all task dependencies can be resolved.

    Coding & AlgorithmsOnsiteGraphTopological SortDFS
  • ByteDanceEasySoftware Engineer
    Debug and Extend a Priority-Aware Python Thread Pool

    This question tests your understanding of thread-safe synchronization primitives, priority queues, and robust resource management in a multi-threaded Python environment.

    Software Engineering FundamentalsOnsiteConcurrencyMultithreadingData Structures
  • ByteDanceMediumSoftware Engineer
    Design Near-Real-Time Top Songs by Country

    This question tests your ability to design a distributed streaming data pipeline that balances high-throughput ingestion with low-latency analytical queries for country-specific rankings.

    System DesignOnsiteStreamingDistributed SystemsScalability
  • ByteDanceMediumSoftware Engineer
    Design a Content Moderation Platform

    This problem evaluates your ability to design a scalable, multi-modal content moderation system that filters user-uploaded media using both automated ML inferences and human review workflows.

    ML System DesignOnsiteSystem DesignMLOpsScalability
  • ByteDanceMediumSoftware Engineer
    Design a Distributed Rate Limiter

    This question tests the ability to design a scalable, low-latency rate limiting service that functions across multiple distributed application servers.

    System DesignOnsiteDistributed SystemsCachingLatency
  • ByteDanceMediumSoftware Engineer
    Design a High-Frequency Job Scheduler

    This question tests your ability to design a distributed, high-frequency job scheduling system that handles millions of tasks with varying priorities while ensuring reliability and strict execution guarantees.

    System DesignOnsiteDistributed SystemsScalabilityConcurrency
  • ByteDanceMediumSoftware Engineer
    Design a Payment System: Time-Boxed High-Level Design

    A time-boxed system design question asking for a high-level payment system that charges users through an external payment provider. It tests the end-to-end checkout flow, idempotent retries, a payment state machine and ledger, asynchronous provider notifications, reconciliation and failure handling.

    System DesignOnsite
  • ByteDanceMediumSoftware Engineer
    Design a Real-Time Auction Platform

    This question evaluates a candidate's ability to design a real-time, high-throughput distributed system focusing on API design, concurrency control, ordering guarantees, idempotency, persistence of bid history and state transitions, and real-time push/update mechanisms.

    System DesignOnsite
  • ByteDanceMediumSoftware Engineer
    Design a Short-Video Recommendation System

    This problem tests the ability to design a multi-stage recommendation pipeline that balances real-time personalization, system latency, and content diversity.

    ML System DesignOnsiteSystem DesignRecommendation SystemsScalability
  • ByteDanceMediumSoftware Engineer
    Design a payment system with real-time holds, batch settlement and safe retries

    System design question: design a payment system that places real-time holds on funds and settles them in batches, then explain how retries avoid double charges. It probes idempotency at every hop, payment state machines, double-entry ledgers, consistency across an external processor, reconciliation, and recovery from specific failures.

    System DesignOnsite