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 691–720 of 1080 results
- MithrilMediumSoftware EngineerDetermine Safe Bomb Defusal
This problem tests your ability to model a system as a directed graph and determine the reachability of a 'safe' state while avoiding 'dead' states using graph traversal algorithms.
Coding & AlgorithmsOnsiteGraphBFSDFS - MithrilMediumSoftware EngineerParse code into operation triads IR
This question evaluates parsing and IR-generation skills, including tokenization, AST or three-address (operation triads) construction, deterministic control-flow serialization, and management of temporaries and labels.
Coding & AlgorithmsOnsite - MolocoHardSoftware EngineerSupport Dynamic Range Sums
This question evaluates knowledge of data structures and algorithmic techniques for range queries and dynamic updates, along with complexity analysis for time and space.
Coding & AlgorithmsOnsite - MolocoadsMediumMachine Learning EngineerFind the Longest Consecutive Run of Ones
Implement an algorithm to find the maximum length of contiguous ones in a binary array without any bit flips, returning 0 for an empty input.
Coding & AlgorithmsOnsitearraystwo-pointerssliding-window - MongoDBMediumSoftware EngineerImplement a thread-safe high-concurrency LRU cache
This problem tests your ability to design a thread-safe LRU cache using a combination of a hash map and a doubly linked list, requiring efficient synchronization to handle concurrent access.
Coding & AlgorithmsOnsiteConcurrencyLRU CacheHash Map - Moody'sMediumSoftware EngineerReturn Binary Search Tree Values in Ascending Order
This problem tests the ability to deserialize a level-order encoded Binary Search Tree into a tree structure and perform an in-order traversal to retrieve sorted values.
Coding & AlgorithmsOnsiteBinary TreeBSTDeserialization - MotiveMediumSoftware EngineerImplement Union-Find and track components
This question evaluates understanding and implementation of the Disjoint Set Union (Union-Find) data structure, covering union by rank, path compression, API design for union(a, b), connected(a, b), count(), and analysis of time and space complexity.
Coding & AlgorithmsOnsite - MotiveMediumSoftware EngineerImplement Union-Find for connectivity
This question evaluates understanding and implementation of the Disjoint Set Union (Union-Find) data structure—including path compression and union by rank—and competency in processing online connectivity queries on undirected graphs, categorized under Coding & Algorithms in the graph algorithms and data structures domain.
Coding & AlgorithmsOnsite - MoveworksMediumSoftware EngineerCompute Jaccard similarity between two strings
This question evaluates string tokenization, set-based similarity metrics (Jaccard index) and basic set operations, testing competency in text processing and algorithmic reasoning within the Coding & Algorithms domain and requiring practical application of these concepts.
Coding & AlgorithmsOnsite - MoveworksMediumSoftware EngineerFind a secret word via match feedback
This question evaluates algorithmic search, pattern-matching, and information-elimination skills in an interactive Mastermind-style word-guessing scenario, testing string comparison and combinatorial reasoning under constrained feedback.
Coding & AlgorithmsOnsite - NVIDIAMediumSoftware EngineerFind all unique triplets summing to zero
This question evaluates array-based algorithm design, handling of duplicate results, and analysis of time and space complexity when producing unique triplets that sum to zero.
Coding & AlgorithmsOnsite - NVIDIAHardSoftware EngineerImplement short algorithms on logs, grids, and strings
This problem tests your ability to handle multi-stage data processing, specifically focusing on greedy interval selection in logs, stack-based parsing of nested strings, and constrained combinatorial optimization on a grid.
Coding & AlgorithmsOnsiteDynamic ProgrammingStackBacktracking - NVIDIAMediumSoftware EngineerSolve small string and API tasks
This problem tests your ability to handle nested structural validation using stacks and the design of a robust API integration function that aggregates paginated responses.
Coding & AlgorithmsOnsiteStackStringsAPI - NetappMediumSoftware EngineerIdentify the Orchestrator in a Server Connection Graph
This problem tests graph theory fundamentals by identifying a central hub node in a star-topology network using adjacency properties.
Coding & AlgorithmsOnsiteGraph TheoryData StructuresAlgorithms - NetappMediumSoftware EngineerMerge Two Sorted Singly Linked Lists
This problem tests the ability to manipulate pointers in a singly linked list to perform an in-place merge of two sorted lists.
Coding & AlgorithmsOnsiteLinked ListsPointersRecursion - NetappMediumSoftware EngineerRank Teams from Ballot Preferences
This problem tests your ability to manage multi-level sorting criteria by implementing custom comparison logic for an array of preference rankings.
Coding & AlgorithmsOnsiteSortingHash MapGreedy - NetflixHardSoftware EngineerCompute Earliest Completion Times
This question evaluates understanding of directed acyclic graphs, dependency resolution, computation of earliest task completion times, and cycle detection within prerequisite relationships.
Coding & AlgorithmsOnsite - 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 - 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 - 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 - 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 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 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 - 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
Moloco
MongoDB
Motive
NVIDIA
Netflix