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 2581–2610 of 2810 results

  • TmlMediumSoftware Engineer
    Implement a Resizable Deque

    This question evaluates proficiency in data structures and array-based implementations, specifically building a resizable double-ended queue (deque) backed by a circular array and understanding amortized O(1) operation costs.

    Coding & AlgorithmsTechnical Screen
  • ToastHardSoftware Engineer
    Code Review of a Multi-File HTTP API: Wrong Method, Payload and Validation Bugs

    A code-review exercise on several files that implement an HTTP API, where the known defects include a GET endpoint that should be POST, a request payload problem and missing input validation. It tests explaining each defect by its impact, fixing it consistently across files, and running a prioritized review within an hour.

    Software Engineering FundamentalsTechnical Screen
  • ToastHardSoftware Engineer
    Design a Restaurant Seat and Table Reservation System

    A system design question asking for a restaurant seat reservation system in which diners search availability by party size and time, then book, change or cancel. It tests the table-and-time inventory model, preventing double booking under concurrent requests, holds, availability caching and partitioning by restaurant.

    System DesignTechnical Screen
  • Together AIHardSoftware Engineer
    Design a GPU-aware pod scheduler

    This interview question evaluates requirements, scale assumptions, API/data design, architecture, trade-offs, failure modes, and rollout in a realistic interview setting. A strong answer for Design a GPU-aware pod scheduler states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    System DesignTechnical Screen
  • Together AIMediumSoftware Engineer
    Detect cycles and break them in pod dependencies

    This question evaluates proficiency with directed graph concepts and dependency resolution, focusing on cycle detection and selecting a single dependency edge whose removal renders the graph acyclic.

    Coding & AlgorithmsTechnical Screen
  • Together AIEasySoftware Engineer
    Diagnose CPU Performance Problems on a Linux Server

    Diagnose Linux CPU slowness from host and thread metrics through scheduling, limits, profiles, and a workload-linked verification of the bottleneck.

    Software Engineering FundamentalsTechnical Screen
  • Together AIEasySoftware Engineer
    Diagnose Slow Network Throughput Including Containers

    Investigate slow network throughput across application, transport, host, and container layers using controlled comparisons, retransmissions, limits, and path behavior.

    Software Engineering FundamentalsTechnical Screen
  • Together AIEasySoftware Engineer
    Diagnose Storage I/O Performance and Identify the Workload

    Diagnose storage slowness using device metrics, process attribution, workload shape, cache and durability effects, and measurements appropriate to the storage stack.

    Software Engineering FundamentalsTechnical Screen
  • Together AIMediumSoftware Engineer
    Historical Lookups in a Timestamped Key-Value Store

    Implement historical key-value lookups using timestamped writes, per-key ordered histories, and binary search for the latest eligible value.

    Coding & AlgorithmsTechnical Screen
  • Together AIEasySoftware Engineer
    Investigate a Server Saturated by Logging

    Trace logging-related server saturation through resource attribution, producer/sink behavior, bounded queues, rotation and retention, and verified mitigation.

    Software Engineering FundamentalsTechnical Screen
  • Together AIMediumSoftware Engineer
    Schedule GPU Pods and Drain a Node

    Implement a GPU cluster manager to schedule workloads using a deterministic best-fit policy and simulate draining a node to check if all its pods can be migrated without disrupting other nodes.

    Coding & AlgorithmsTechnical ScreenGreedySimulationSystem Design
  • Together AIEasySoftware Engineer
    Split a Chunked Text Stream into Line-Balanced Parts

    Construct any balanced whole-line partition of a chunked text stream, preserving exact content and newline rules while explaining buffering and streaming limits.

    Coding & AlgorithmsTechnical Screen
  • TomaMediumSoftware Engineer
    Implement AudioStream Mixer

    This problem tests your ability to manage temporal data and stateful buffers by implementing a class that merges multiple incoming audio streams into a single output track using overwrite-based mixing logic.

    Coding & AlgorithmsTechnical ScreenHashMapsData StructuresSimulation
  • TrexquantMediumSoftware Engineer
    C++ Fundamentals: const Pointers, and map vs unordered_map

    This question evaluates a candidate's grasp of C++ fundamentals, specifically const-correctness with pointers and the distinction between ordered and hash-based associative containers. It tests conceptual understanding of pointer semantics and data structure trade-offs (tree vs. hash table complexity and ordering), a common check in language-fundamentals interview rounds.

    Software Engineering FundamentalsTechnical Screen
  • TrexquantMediumSoftware Engineer
    Streaming Median Tracker

    This question evaluates a candidate's ability to design a data structure that maintains a running median over a stream of numbers, testing knowledge of heaps and balanced data partitioning. It is a classic coding and algorithms interview problem used to assess understanding of amortized time complexity and efficient online statistics tracking, requiring practical implementation rather than just conceptual discussion.

    Coding & AlgorithmsTechnical Screen
  • TripStackMediumSoftware Engineer
    Compute minimum resources for overlapping intervals

    This question evaluates understanding of interval overlap reasoning, resource-allocation and scheduling concepts, and proficiency with algorithmic complexity and appropriate data structure choices.

    Coding & AlgorithmsTechnical Screen
  • TripStackHardSoftware Engineer
    Explain Go concurrency and database choices

    This question evaluates a candidate's understanding of Go concurrency primitives and scheduler behavior, cross-language concurrency comparisons, database model trade-offs (relational, document, columnar, key–value), and end-to-end storage design for high-concurrency systems.

    System DesignTechnical Screen
  • TubiMediumSoftware Engineer
    Execute TTL Cache Operations with Fetch-on-Miss

    Implement a deterministic TTL cache simulator with put, get, delete, size, and fetch-on-miss operations. Preserve expired records until deletion or replacement, model loader success and failure explicitly, and validate timestamped JSON-compatible inputs.

    Coding & AlgorithmsTechnical Screen
  • TubiMediumSoftware Engineer
    Make Cache Fetch Thread-Safe and Single-Flight

    Design a thread-safe cache fetch operation that coalesces concurrent misses for the same key while allowing different keys to load in parallel. Define linearization points, generation-aware publication, lock scope, timeout and error handling, deletion races, and stale completion cleanup.

    Software Engineering FundamentalsTechnical Screen
  • TuringMediumSoftware Engineer
    Count permutations with exactly n inversions

    This Coding & Algorithms question evaluates combinatorial counting and algorithmic skills related to permutations and inversion counts, emphasizing dynamic programming and modular arithmetic for large-result handling.

    Coding & AlgorithmsTechnical Screen
  • TuroMediumSoftware Engineer
    Check if a word exists in a grid

    This question evaluates a candidate's skills in backtracking search, grid traversal, and managing state for constrained path-finding problems. Commonly asked to assess algorithmic problem-solving, recursion and memory-management (including in-place visited marking) within the Coding & Algorithms domain, it emphasizes practical application and understanding of time and space complexity trade-offs rather than purely theoretical concepts.

    Coding & AlgorithmsTechnical Screen
  • TuroMediumSoftware Engineer
    Design trip booking REST API and schema

    This question evaluates RESTful API design, temporal data modeling, inventory management strategies, request/response/status-code design, data schema and indexing, and handling booking lifecycle changes such as extensions.

    System DesignTechnical Screen
  • TuroMediumSoftware Engineer
    Plan a major database version upgrade

    This question evaluates competency in database upgrade planning, including data migration strategies, cutover coordination, compatibility considerations, change-data-capture versus dual-write trade-offs, and rollback and risk management.

    System DesignTechnical Screen
  • TuroMediumSoftware Engineer
    Route HTTP requests to pods in a cluster

    This question evaluates understanding of request routing, service discovery, virtual service abstractions, load balancing algorithms, health checks, and fault-tolerance mechanisms within containerized cluster environments, testing competencies in distributed systems and networked service architecture.

    System DesignTechnical Screen
  • Two SigmaMediumSoftware Engineer
    Autoscale a Server Fleet from Throughput Readings

    This question evaluates algorithmic implementation skills and numeric reasoning, focusing on stateful simulation of autoscaling behavior and capacity arithmetic under streaming throughput readings.

    Coding & AlgorithmsTechnical Screen
  • Two SigmaHardSoftware Engineer
    Compute maximum currency exchange rate

    Compute maximum currency exchange rate 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
  • Two SigmaMediumSoftware Engineer
    Design GenAI Fine-Tuning and Agent Tradeoffs

    Design an enterprise GenAI research agent platform, evaluating trade-offs between fine-tuning methods (Full, LoRA, QLoRA) versus RAG, alongside agent orchestration, structured outputs, and safety controls.

    ML System DesignTechnical ScreenLLM Fine-TuningAI AgentsModel Serving
  • Two SigmaMediumSoftware Engineer
    Design and Scale Quantitative Optimization Workflows

    Design a scalable, deterministic quantitative optimization and backtesting platform capable of executing 30,000 portfolio optimization runs with strict point-in-time data correctness and full data lineage.

    System DesignTechnical ScreenDistributed SystemsQuantitative FinanceBatch Processing
  • Two SigmaMediumSoftware Engineer
    Implement Price-Time Order Matching

    Design and implement an in-memory limit order book matching engine supporting buy and sell orders with price-time priority (FIFO) and order cancellation.

    Coding & AlgorithmsTechnical Screenheapdesignhash-table
  • Two SigmaMediumSoftware Engineer
    Implement a Hash Map with Separate Chaining and Resizing

    This question evaluates understanding of hash table fundamentals, including hashing, separate chaining collision resolution, linked-list bucket management, dynamic resizing, and rehashing to maintain load factor and amortized performance.

    Coding & AlgorithmsTechnical Screen