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 1681–1710 of 2810 results

  • NVIDIAEasySoftware Engineer
    Write SQL to sum city population by name

    Assesses SQL proficiency in relational joins and aggregation by asking for a total population computed from ZIP-level data and evaluates reasoning about duplicate entity names.

    Software Engineering FundamentalsTechnical Screen
  • Nash AIMediumSoftware Engineer
    Design OOD for probabilistic Minesweeper

    Design OOD for probabilistic Minesweeper 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
  • Nash AIMediumSoftware Engineer
    Design real-time delivery tracking with async updates

    This question tests the ability to design a high-throughput, real-time location tracking system that ensures eventual consistency and correct state representation despite network latency and duplicate events.

    System DesignTechnical ScreenScalabilityEvent-DrivenCaching
  • Nash AIMediumSoftware Engineer
    Implement Minesweeper click and print

    Implement Minesweeper click and print 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
  • Nash AIMediumSoftware Engineer
    Implement Minesweeper click-to-reveal expansion

    This problem tests your ability to implement recursive traversal (flood-fill) on a 2D grid and manage game state transitions based on player input.

    Coding & AlgorithmsTechnical ScreenDFSBFSMatrix
  • NetflixMediumSoftware Engineer
    Analyze Overlap in Closed Intervals

    Implement an algorithm to determine how many closed intervals contain each point in a given list of query coordinates. The problem evaluates interval sweep-line techniques or binary search decomposition, boundary handling, and time/space complexity.

    Coding & AlgorithmsTechnical Screenbinary-searchintervalssweep-line
  • NetflixMediumSoftware Engineer
    Build and optimize a video playlist component

    Build and optimize a video playlist component 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
  • NetflixEasySoftware Engineer
    Compute Minimum Broadcast Latencies Between Cities

    Implement Dijkstra's algorithm to compute the minimum broadcast latency from a source city to all other cities in an undirected, weighted network.

    Coding & AlgorithmsTechnical Screengraphdijkstrashortest-path
  • NetflixMediumSoftware Engineer
    Compute Minimum Task Completion Time

    This problem tests your ability to model task dependencies as a Directed Acyclic Graph (DAG) and compute the longest path in that graph to determine the earliest completion time.

    Coding & AlgorithmsTechnical ScreenGraphTopological SortDynamic Programming
  • NetflixMediumSoftware Engineer
    Count Pairs of Strings with Disjoint Character Sets

    Tests bitmask representation of character sets, frequency-based pair counting, and handling edge cases like empty strings.

    Coding & AlgorithmsTechnical ScreenBit ManipulationHash TableString
  • NetflixHardSoftware Engineer
    Demonstrate domain expertise and ramp-up ability

    This question evaluates domain expertise and ramp-up ability by examining prior experience, learning strategies for unfamiliar domains, cross-functional collaboration, and measurable impact within a software engineering context.

    Behavioral & LeadershipTechnical Screen
  • NetflixMediumSoftware Engineer
    Design Netflix viewport deduplication

    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 Netflix viewport deduplication states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    System DesignTechnical Screen
  • NetflixMediumSoftware Engineer
    Design Prefix-Aware Deduplication for Homepage Content Rows

    Implement prefix-aware content row deduplication where protected row prefixes cannot share items across rows, while suffixes and exempt rows only enforce row-internal uniqueness.

    Software Engineering FundamentalsTechnical ScreenArraysHash TableData Manipulation
  • NetflixHardSoftware Engineer
    Design a File Backup System

    This question evaluates understanding of scalable system design, file synchronization and metadata handling, data consistency, fault tolerance, and performance trade-offs involved in designing a file backup system.

    System DesignTechnical Screen
  • NetflixMediumSoftware Engineer
    Design a Job Scheduler for ML Training and Batch Inference on a Shared Cluster

    Design a job scheduler for machine learning workloads such as training runs and batch inference on a shared compute cluster with GPUs. It tests requirements gathering, queueing and fairness between teams, gang placement for distributed jobs, preemption and checkpointing, and recovery from node and scheduler failures.

    System DesignTechnical Screen
  • NetflixHardSoftware Engineer
    Design a concurrent latency percentile tracker

    This problem tests your ability to design a high-throughput, thread-safe data structure capable of tracking request latencies and calculating arbitrary percentiles (e.g., p99) within a sliding time window.

    Software Engineering FundamentalsTechnical ScreenConcurrencyData StructuresMetrics
  • NetflixEasySoftware Engineer
    Design a crash-resilient file system

    This question evaluates understanding of durable storage and crash recovery mechanisms in file system design, including metadata consistency, durability guarantees, and operational concerns like performance and space overhead.

    System DesignTechnical Screen
  • NetflixMediumSoftware Engineer
    Design a thread-safe key-value store

    This question evaluates knowledge of concurrent programming and thread-safety, including the choice of in-memory data structures for a key–value store and synchronization techniques that ensure atomic put/get/delete operations without internal corruption.

    Software Engineering FundamentalsTechnical Screen
  • NetflixHardSoftware Engineer
    Design an ads audience targeting system

    This problem evaluates your ability to design a high-scale, low-latency system for filtering user profiles against complex, dynamic advertising audience segments.

    System DesignTechnical ScreenScalabilityDistributed SystemsCaching
  • NetflixHardSoftware Engineer
    Design command executor with undo

    This problem tests the application of the Command design pattern and stack-based data structures to manage reversible operations in an application state.

    Coding & AlgorithmsTechnical ScreenDesign PatternsStacksCommand Pattern
  • NetflixMediumSoftware Engineer
    Design homepage viewport rendering with deduplication

    This problem tests the ability to design a content-delivery service that optimizes viewport rendering through client-side requests, server-side deduplication, and efficient data retrieval patterns.

    System DesignTechnical ScreenAPI DesignCachingHigh Availability
  • NetflixHardSoftware Engineer
    Design viewport dedup for Netflix home page

    Design viewport dedup for Netflix home page 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
  • NetflixMediumSoftware Engineer
    Find longest run of identical consecutive shows

    This question tests the ability to track state while iterating through an array to identify the longest contiguous sub-sequence of identical elements.

    Coding & AlgorithmsTechnical ScreenArraysIterationAlgorithms
  • NetflixMediumSoftware Engineer
    Find longest unique show window

    This question evaluates concepts in sliding-window algorithms, hash-based duplicate tracking, case-insensitive string handling, and the extension of batch solutions to streaming (online) inputs.

    Coding & AlgorithmsTechnical Screen
  • NetflixMediumSoftware Engineer
    Find the Longest Run of One Character

    Tests linear scan and two-pointer/state-tracking techniques to find the maximum number of consecutive identical characters in an ASCII string using constant auxiliary space.

    Coding & AlgorithmsTechnical Screenstringstwo-pointerslinear-scan
  • NetflixMediumSoftware Engineer
    Find the Longest Substring Without Repeated Characters

    Tests sliding window technique, hash map index tracking, and linear-time constraint optimization on string manipulation.

    Coding & AlgorithmsTechnical ScreenSliding WindowTwo PointersHash Table
  • NetflixEasySoftware Engineer
    Implement a Key-Value Cache with Per-Entry Expiration

    This problem tests the ability to design an in-memory storage system that combines fixed-capacity constraints with time-based invalidation logic.

    Software Engineering FundamentalsTechnical ScreenHash MapLinked ListConcurrency
  • NetflixMediumSoftware Engineer
    Implement an in-memory key-value store with per-key TTL expiration and tests

    A coding interview question that asks you to implement an in-memory key-value store whose entries expire after a per-key time-to-live, explain the design as you go, and test it. It tests expiry semantics, overwrite handling, reclaiming memory from keys that are never read again, complexity trade-offs and deterministic tests with a controllable clock.

    Software Engineering FundamentalsTechnical Screen
  • NetflixMediumSoftware Engineer
    Implement weighted-eviction cache

    This question evaluates understanding and practical implementation of data structures and algorithms for a weighted cache, including weighted eviction policies, use of ordered maps, and time-space complexity analysis.

    Coding & AlgorithmsTechnical Screen
  • NetflixMediumSoftware Engineer
    Movie Playlist With Live Score Updates and No Repeats per Loop, Plus Thread Safety

    Implement an in-memory movie playlist in which get returns the highest-scoring movie not yet served in the current loop, starting a new loop once every movie has been served, while scores can change at any time. A follow-up asks where to add locks when many threads call it concurrently.

    Software Engineering FundamentalsTechnical Screen