practice a little every day, paws crossed ♡
Coding & Algorithms 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 1981–2010 of 3276 results
- NetflixHardSoftware EngineerCompute subtree sums with tree DFS
This question evaluates proficiency in tree traversal and aggregation techniques, specifically computing subtree sums using depth-first search while handling traversal state and constraints such as negative values and large n.
Coding & AlgorithmsOnsite - NetflixMediumSoftware EngineerCount 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 EngineerDesign 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerGroup 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 - NetflixMediumData ScientistIdentify Longest Consecutive Incrementing Watch-Time Sequence
This question evaluates a candidate's ability to design and analyze efficient algorithms for detecting longest consecutive incrementing sequences in unsorted integer arrays, testing understanding of appropriate data structures and time/space complexity trade-offs.
Coding & AlgorithmsOnsite - NetflixMediumSoftware EngineerImplement 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 EngineerImplement 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 - NetflixMediumMachine Learning EngineerImplement Streaming Word Counter
This question evaluates streaming data processing, string tokenization, and frequency-aggregation competencies, focusing on maintaining accurate counts over incremental text inputs using associative data structures.
Coding & AlgorithmsTechnical Screen - NetflixMediumSoftware EngineerImplement 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 - NetflixHardSoftware EngineerImplement 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 - NetflixHardData EngineerImplement a Weighted Eviction Cache
This problem tests your ability to design a cache that respects both memory capacity and item weights, requiring an efficient combination of a hash map and a doubly linked list.
Coding & AlgorithmsTechnical ScreenHash MapDoubly Linked ListLRU Cache - NetflixMediumData ScientistImplement longest increasing subarray with one deletion
This question evaluates proficiency in array algorithms and algorithmic optimization, focusing on handling boundary cases, reconstructing index ranges, and meeting strict O(n) time and O(1) extra-space constraints.
Coding & AlgorithmsOnsite - NetflixMediumSoftware EngineerImplement 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 - NetflixHardData EngineerImplement phrase search and JSON path
This problem tests your ability to process unstructured text into a searchable index and navigate hierarchical data structures using path patterns.
Coding & AlgorithmsOnsiteInverted IndexString ProcessingRecursion - NetflixMediumSoftware EngineerImplement 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 - NetflixEasyMachine Learning EngineerMultiply Two Sparse Integer Matrices Given as Dense Grids
Given two integer matrices stored as dense lists of rows in which most entries are zero, return their exact matrix product. It tests handling matrix dimensions correctly and exploiting sparsity to skip work on zero entries while still producing every entry of the result.
Coding & AlgorithmsOnline Assessment - NetflixMediumSoftware EngineerReport 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 EngineerReturn 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 EngineerReturn 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 EngineerSimulate 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 - NetflixMediumSoftware EngineerSolve non-repeating show substring
This question evaluates understanding of sequence processing, uniqueness detection, and the use of auxiliary data structures to track previously seen elements when finding non-repeating contiguous subsequences, applied to show names instead of characters.
Coding & AlgorithmsTechnical Screen - NetflixMediumSoftware EngineerSolve sliding-window and disjoint-string-pairs tasks
This question tests the ability to combine sliding window techniques with bit manipulation or frequency counting to identify pairs of substrings that share no common characters.
Coding & AlgorithmsTechnical ScreenStringsBit ManipulationSliding Window - New RelicMediumBackend EngineerCompress a String by Run-Length Counts, Keeping the Original When Not Shorter
Implement run-length string compression that replaces each run of repeated characters with the character and its count, returning the original string when the compressed form is not strictly shorter. Tests careful run handling, multi-digit counts, the tie rule, and complexity and edge-case discussion.
Coding & AlgorithmsOnsite - New RelicMediumBackend EngineerLongest Strictly Increasing Path in a Grid with Four-Directional Moves
Given an integer matrix, find the number of cells on the longest path whose values strictly increase, moving only up, down, left, or right with no diagonal steps and no wrap-around at the edges. Tests grid search and the ability to turn a working first solution into an efficient one.
Coding & AlgorithmsOnsite - NewrelicHardSoftware EngineerMaximum Path Sum in an Indexed Binary Tree
This problem tests tree traversal techniques on an index-based representation, focusing on handling negative weights and memory efficiency via an iterative post-order approach.
Coding & AlgorithmsTechnical ScreenBinary TreeDynamic ProgrammingIterative Traversal - NewrelicHardSoftware EngineerProduct of Array Except Self Without Division
This problem tests array manipulation skills and the ability to optimize space complexity by using prefix and suffix product passes instead of division.
Coding & AlgorithmsTechnical ScreenArraysPrefix-SumOptimization
Netflix