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 3751–3780 of 5874 results

  • 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
  • NetflixMediumSoftware Engineer
    Group users by same last K watched movies

    This question evaluates competency in set operations, grouping via maps/dictionaries, and algorithmic complexity analysis when comparing suffixes of ordered lists.

    Coding & AlgorithmsOnline Assessment
  • NetflixHardSoftware Engineer
    How do you give and receive feedback?

    This question evaluates a software engineer's interpersonal competencies, specifically the ability to give and receive constructive feedback, demonstrate emotional intelligence, take ownership, and collaborate across cross-functional teams.

    Behavioral & LeadershipOnsite
  • NetflixMediumSoftware Engineer
    Implement Cache, Undo, and DFS

    This problem tests your ability to combine a Least Recently Used (LRU) cache with a command-based undo system, applied to a hierarchical tree structure traversal.

    Coding & AlgorithmsOnsiteLRU CacheDFSUndo Pattern
  • NetflixMediumSoftware Engineer
    Implement Caches, Undo, and Traversal

    This question evaluates proficiency with data structures, API design, and system-level concerns by combining timed in-memory caching, command undo/redo semantics, and depth-first traversal of a tree; it falls under the Coding & Algorithms domain and is commonly asked to assess practical implementation skills, correctness under edge cases, and the ability to reason about time and space complexity. The level of abstraction spans practical application—designing clean APIs and implementing core logic—while also requiring conceptual understanding of complexity analysis and background cleanup or state-management patterns.

    Coding & AlgorithmsOnsite
  • NetflixMediumSoftware Engineer
    Implement TTL Cache and Tree Balance Reporting

    This question evaluates proficiency in designing efficient in-memory data structures and tree algorithms, specifically time-to-live cache behavior (expiration semantics and accurate unexpired counts) and per-node subtree-height computations for balance reporting, and it falls under the Coding & Algorithms domain.

    Coding & AlgorithmsOnsite
  • 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
  • NetflixHardSoftware Engineer
    Implement a Versioned Key-Value Store

    This question evaluates understanding of time-versioned data storage, related data-structure selection, handling of overwrite semantics at equal timestamps, and the ability to reason about correctness and complexity trade-offs.

    Coding & AlgorithmsOnsite
  • 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 ordering and undo executor

    This question evaluates graph algorithm skills (topological ordering and cycle detection) and software design competencies related to command interfaces, undo semantics, and shared-state management.

    Coding & AlgorithmsOnsite
  • 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
    Model Direct-Sold DSP Orders

    This Software Engineering Fundamentals question evaluates data and domain modeling skills for ad-technology order management, focusing on entities such as advertisers, agencies, orders, line items, targeting, creatives, delivery constraints, tracking events, reporting needs, and configuration versioning.

    Software Engineering FundamentalsOnsite
  • NetflixMediumSoftware Engineer
    Model ads demand data for reporting

    This question tests the ability to design a robust data pipeline and schema for tracking ad performance metrics, focusing on handling event-level data, aggregations, and dimension consistency.

    System DesignOnsiteData EngineeringData ModelingETL
  • NetflixMediumSoftware Engineer
    Model data for an ads platform

    This question evaluates proficiency in data modeling and database schema design for advertising systems, including entity-relationship modeling, privacy-aware user identifier handling, and delivery/tracking log representation.

    System DesignOnsite
  • 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
  • NetflixMediumSoftware Engineer
    Plan Eviction and Cleanup for a Production Cache

    This problem tests the design of an in-memory caching system, focusing on memory management, eviction strategies, and concurrency control to ensure high performance and stability.

    Software Engineering FundamentalsTechnical ScreenSystem DesignConcurrencyCaching
  • NetflixMediumSoftware Engineer
    Reason About a Movie Billboard Rotation Component

    This problem tests the ability to manage dynamic scheduling and priority updates using balanced binary search trees (ordered maps) while handling concurrency and system scalability.

    Software Engineering FundamentalsOnsiteData StructuresConcurrencySystem Design
  • NetflixMediumSoftware Engineer
    Recommend New Friends from a Mutual-Friendship Graph and Scale the Approach

    A problem-solving question about recommending new friends from a mutual friendship graph, worked mostly through discussion with a little code and pseudocode. It tests candidate generation and scoring with deterministic tie-breaks, cost in terms of node degree, handling highly connected users, and precomputing and refreshing suggestions at scale.

    Software Engineering FundamentalsOther
  • NetflixMediumSoftware Engineer
    Report Tree Levels and Balanced Subtrees

    Tests traversing a binary tree stored in array (heap) layout to compute subtree heights and identify nodes rooted at height-balanced subtrees along with their tree levels.

    Coding & AlgorithmsOnsitebinary-treeheapdepth-first-search
  • NetflixMediumSoftware Engineer
    Return the longest contiguous subarray with all distinct values

    This problem tests your ability to use the sliding window pattern and a hash map to maintain a range of unique elements efficiently in O(n) time.

    Coding & AlgorithmsTechnical ScreenSliding WindowHash MapArrays
  • NetflixMediumSoftware Engineer
    Return valid task order from prerequisites

    This question evaluates proficiency in graph algorithms, notably topological sorting and cycle detection, as well as algorithmic complexity analysis and handling of dependency constraints.

    Coding & AlgorithmsOnsite
  • NetflixMediumSoftware Engineer
    Session Token Cache With Per-Entry Expiry and a Test Suite

    Implement an in-memory cache whose entries expire individually, reclaim memory for keys that are never read again, and prove it with deterministic tests using an injected clock. Tests expiry semantics, stale-entry handling and test design.

    Software Engineering FundamentalsTechnical Screendata-structuresheapcaching
  • NetflixMediumSoftware Engineer
    Show Behavioral Fit and Experience

    Show Behavioral Fit and Experience evaluates behavioral evidence, ownership, communication, trade-offs, and measurable outcomes in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Behavioral & LeadershipHR Screen
  • NetflixMediumSoftware Engineer
    Show role fit using past ad experience

    This question evaluates a candidate's ability to demonstrate role fit by mapping past ads engineering projects to job requirements and communicating measurable impact, assessing competencies such as ownership, cross-functional collaboration, incident debugging, and prioritization.

    Behavioral & LeadershipOnsite
  • NetflixMediumSoftware Engineer
    Simulate a TTL Cache with LRU Eviction

    Implement a fixed-capacity key-value cache combining per-key TTL expiration with LRU eviction and O(1) average time per operation.

    Coding & AlgorithmsTechnical ScreenCacheLRUHash Table