Katkat

practice a little every day, paws crossed ♡

Machine Learning 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 1–30 of 108 results

  • AdobeMediumMachine Learning Engineer
    Determine if a multiple-sum subarray exists

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Determine if a multiple-sum subarray exists states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsOnsite
  • AirbnbMediumMachine Learning Engineer
    Minimize exact layover bookings

    This problem tests your ability to use dynamic programming to determine if a specific target sum can be achieved using a subset of given item values and how to find the minimum subset size that hits that target.

    Coding & AlgorithmsOnsiteDynamic ProgrammingOptimizationAlgorithms
  • AirbnbMediumMachine Learning Engineer
    Redact Document Phrases with Simultaneous Replacement

    Redact document phrases with a replacement map, whole-word matching, longest-match overlap rules, and one-pass replacement of original text.

    Coding & AlgorithmsOnsite
  • AirbnbMediumMachine Learning Engineer
    Solve Decimal Coin Change

    This question evaluates proficiency in dynamic programming for coin-change problems and competency in numerical precision and safe handling of decimal monetary values in algorithmic implementations.

    Coding & AlgorithmsOnsite
  • AnthropicMediumMachine Learning Engineer
    Convert State Stream to Events

    This question tests the ability to process a stream of state changes, group consecutive identical values into distinct event intervals, and filter these events based on duration.

    Coding & AlgorithmsOnsiteArraysData ProcessingAlgorithms
  • AnthropicMediumMachine Learning Engineer
    Implement a web crawler using a provided API

    This problem tests your ability to design a multi-threaded web crawler that efficiently traverses a site while respecting domain constraints and avoiding redundant work.

    Coding & AlgorithmsOnsiteConcurrencyGraph TraversalBFS
  • AnthropicMediumMachine Learning Engineer
    Implement an extensible prefix tree

    This question evaluates the ability to design and implement an extensible prefix tree (trie), covering competencies in Unicode-aware string handling, memory and time optimization, concurrency or thread-safety considerations, and support for operations like insert, search, startsWith, countPrefix and erase.

    Coding & AlgorithmsOnsite
  • AppleMediumMachine Learning Engineer
    Implement Kubernetes Service Dependency Queries

    This question evaluates proficiency with data structures and algorithms for service inventory operations, including deterministic filtering, attribute matching, graph traversal for transitive dependency resolution, and status propagation across service graphs.

    Coding & AlgorithmsOnsite
  • AppleMediumMachine Learning Engineer
    Implement permutations and image retrieval

    This question evaluates algorithmic implementation and computational thinking across combinatorics, image processing, and vector similarity—specifically testing permutation generation, 2D convolution with explicit boundary handling, and nearest-neighbor retrieval for image embeddings.

    Coding & AlgorithmsOnsite
  • AppleMediumMachine Learning Engineer
    Solve stock and banana problems

    This question evaluates algorithmic problem-solving skills related to array processing, optimization under constraints, and reasoning about performance trade-offs by presenting a maximum single-transaction stock profit problem and a minimum banana-eating speed problem.

    Coding & AlgorithmsOnsite
  • AtlassianMediumMachine Learning Engineer
    Assign bookings to minimum tennis courts

    This problem tests your ability to manage overlapping time intervals using a greedy approach, specifically requiring the calculation of the maximum number of concurrent bookings to determine the minimum resource count.

    Coding & AlgorithmsOnsiteGreedySortingIntervals
  • AtlassianHardMachine Learning Engineer
    Compute a moving average on a stream

    This problem tests your ability to maintain a running average over a sliding window of size K in a high-throughput streaming environment while managing numerical precision and memory efficiency.

    Coding & AlgorithmsOnsiteAlgorithmsData StructuresStreaming
  • AtlassianMediumMachine Learning Engineer
    Compute inverse-depth weighted sum of a nested list

    This problem tests your ability to traverse nested list structures using recursion or iterative stacks and compute a value based on the nesting depth of individual elements.

    Coding & AlgorithmsOnsiteRecursionTreesData Structures
  • AtlassianMediumMachine Learning Engineer
    Compute moving average over last N stream

    This question evaluates understanding of streaming algorithms and sliding-window aggregation within the Coding & Algorithms domain, focusing on incremental computation, state management, and numerical stability when computing moving averages.

    Coding & AlgorithmsOnsite
  • AtlassianMediumMachine Learning Engineer
    Design O(1) cache and moving average

    This problem tests your ability to maintain constant-time complexity for both cache management and sliding-window statistics by using a combination of a doubly-linked list and hash maps.

    Coding & AlgorithmsOnsiteLRU CacheData StructuresSliding Window
  • AtlassianMediumMachine Learning Engineer
    Find LCA in a tree and extend to a DAG

    This problem tests your understanding of tree traversal, graph theory, and how to generalize path-finding algorithms from trees to directed acyclic graphs (DAGs).

    Coding & AlgorithmsOnsiteGraphsLCATrees
  • AtlassianHardMachine Learning Engineer
    Find a secret word using match feedback

    Design an optimal querying strategy to identify a secret word from a candidate vocabulary using exact-match character feedback under a strict query budget.

    Coding & AlgorithmsOnsiteAlgorithmsMinimaxInformation Theory
  • ByteDanceHardMachine Learning Engineer
    Count Special Subarrays by Modular Frequency

    This question evaluates the ability to apply modular arithmetic, frequency tracking, and prefix-count reasoning to efficiently count subarrays that satisfy a congruence condition, testing algorithmic problem-solving and scalable complexity management.

    Coding & AlgorithmsOnsite
  • Capital OneMediumMachine Learning Engineer
    Return all root-to-leaf tree paths

    This question evaluates competence with binary tree structures, path enumeration and traversal techniques along with the ability to represent traversal results as formatted strings.

    Coding & AlgorithmsOnsite
  • CohereMediumMachine Learning Engineer
    Implement Autoregressive Decoding Strategies

    This problem tests your ability to implement common sequence decoding strategies used in large language models by manipulating token probability distributions.

    Coding & AlgorithmsOnsiteLLMSamplingSoftmax
  • CoinbaseMediumMachine Learning Engineer
    Write SQL to rank top products per category

    This question evaluates SQL proficiency in aggregation, time-based filtering, joining transactional and reference tables, and ranking/windowing techniques to compute and deterministically order product revenue with tie-breaking by product_id.

    Coding & AlgorithmsOnsite
  • DatabricksMediumMachine Learning Engineer
    Delete a Character From Cover

    This problem tests your ability to manage dynamic string indices by maintaining a set of active intervals and adjusting them efficiently after a character deletion.

    Coding & AlgorithmsOnsiteStringsIntervalsArrays
  • DoorDashMediumMachine Learning Engineer
    Find closest value to a target in a BST

    This question evaluates understanding of binary search tree properties and numeric approximation, measuring competence in tree traversal, comparison logic, and algorithmic efficiency under input-size constraints.

    Coding & AlgorithmsOnsite
  • FigmaMediumMachine Learning Engineer
    Implement Layer History and Grid Counting

    This question tests state management through a Command pattern implementation for undo/redo operations and spatial reasoning using depth-first search (DFS) to identify connected components in a 2D grid.

    Coding & AlgorithmsOnsiteDesign PatternsStackGraphs
  • FurtheraiMediumMachine Learning Engineer
    Merge Overlapping Closed Intervals Into a Sorted Disjoint List

    A coding question that merges an unsorted list of closed integer intervals into disjoint intervals sorted by start. Intervals that overlap or merely touch at an endpoint must be combined, so it tests exact endpoint semantics, transitive merges, and nested or duplicate intervals.

    Coding & AlgorithmsOnsite
  • GleanMediumMachine Learning Engineer
    Decide If a Passenger Can Reach a Station Using Time-Indexed Train Routes and Transfers

    Given trains described as time-indexed lists of stations, decide whether a passenger starting at one station at time zero can reach another by riding, waiting and transferring. Tests modeling station and time as search states, handling waits and same-time transfers, and breadth-first search over a time-expanded graph.

    Coding & AlgorithmsOnsite
  • GleanMediumMachine Learning Engineer
    Find Earliest Train Route

    This question evaluates a candidate's ability to model and search time-dependent transit networks, combining temporal graph reasoning, state-space search, and path reconstruction for itinerary reporting.

    Coding & AlgorithmsOnsite
  • GleanMediumMachine Learning Engineer
    Implement Rate-Limited Wikipedia Crawler

    This question evaluates a candidate's ability to implement a rate-limited web crawler, testing skills in crawl frontier management, prioritization by page-title initial, deduplication, rate limiting, and robust error handling.

    Coding & AlgorithmsOnsite
  • GoogleMediumMachine Learning Engineer
    Compute sum over consecutive-step subarrays

    This problem tests your ability to identify contiguous subarrays that follow an arithmetic progression with a common difference of 1 (consecutive steps) and calculate the sum of elements within these subarrays efficiently.

    Coding & AlgorithmsOnsiteArraysMathSliding Window
  • GoogleHardMachine Learning Engineer
    Solve several streaming, DAG, and DP tasks

    Implement an ML pipeline optimization engine that calculates critical path latency and peak parallelism for a task DAG, and optimizes streaming checkpoint placement under sliding-window constraints using dynamic programming.

    Coding & AlgorithmsOnsiteDAGDynamic ProgrammingSliding Window