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 181–210 of 253 results

  • RobloxEasyMachine Learning Engineer
    Extend counter to per-client rate limiting

    This question evaluates competency in designing per-client, time-windowed rate limiting using efficient data structures for time-based eviction and counting within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • RobloxMediumMachine Learning Engineer
    Find Windows Containing a Target

    This problem tests your ability to efficiently filter and identify intervals within a collection that satisfy specific containment constraints using two-pointer or sliding window techniques.

    Coding & AlgorithmsOnsiteArraysFilteringIntervals
  • RobloxMediumMachine Learning Engineer
    Find target-heavy sliding windows

    This question tests the ability to implement an efficient sliding window algorithm to analyze frequency-based patterns within a data stream or array.

    Coding & AlgorithmsOnsiteSliding WindowAlgorithmsArray
  • RobloxEasyMachine Learning Engineer
    Find the Most Frequent Log Call

    This question evaluates a candidate's ability to perform frequency analysis on sequences, demonstrating competency with data structures for counting occurrences and with algorithmic time and space complexity considerations.

    Coding & AlgorithmsTechnical Screen
  • RobloxEasyMachine Learning Engineer
    Implement recent-requests counter

    This question evaluates a candidate's ability to design efficient in-memory data structures and manage time-windowed event counting, testing algorithmic reasoning and performance optimization for high-throughput services.

    Coding & AlgorithmsTechnical Screen
  • RobloxMediumMachine Learning Engineer
    Level-Ordered Dependency Build Order

    This problem tests your ability to perform a Kahn’s algorithm-based topological sort while grouping tasks into parallelizable layers, ensuring cycle detection and dependency validation.

    Coding & AlgorithmsTechnical ScreenGraphBFSTopological Sort
  • RogoMediumMachine Learning Engineer
    Infer the Smallest Valid Character Order from Sorted Password Hints

    This problem tests your ability to model dependency constraints using a Directed Acyclic Graph (DAG) and apply Kahn's algorithm or DFS-based topological sorting to resolve ordering dependencies.

    Coding & AlgorithmsOnsiteGraphTopological SortPriority Queue
  • SamsungMediumMachine Learning Engineer
    Maximize sum of non-adjacent values

    This question evaluates algorithmic problem-solving skills, specifically understanding of dynamic programming and optimization when selecting non-adjacent elements, within the Coding & Algorithms domain.

    Coding & AlgorithmsOnsite
  • SamsungMediumMachine Learning Engineer
    Validate palindrome with constraints

    This question evaluates a candidate's ability to implement string-processing algorithms and two-pointer techniques under O(n) time and O(1) extra space constraints, including character filtering, case normalization, edge-case handling, and algorithmic complexity analysis.

    Coding & AlgorithmsTechnical Screen
  • Scale AIEasyMachine Learning Engineer
    Implement multi-head attention and LLM sampling

    This problem tests your ability to implement the core mechanics of a Transformer's attention mechanism and the logic required to sample the next token from a model's output logits.

    Coding & AlgorithmsOnsiteTransformersDeep LearningNumPy
  • SealthEasyMachine Learning Engineer
    Implement one-cluster k-means

    This question tests the ability to implement a one-cluster k-means algorithm (finding the geometric centroid) and understanding of the mathematical property that minimizes sum of squared errors.

    Coding & AlgorithmsOnsiteK-MeansClusteringStatistics
  • ShopifyMediumMachine Learning Engineer
    Implement URL Shortening Codec

    This question evaluates understanding of hashing, encoding, state management, and collision-handling strategies for creating a consistent mapping between long and short URLs, testing competencies in data structures, algorithms, and simple system design within the Coding & Algorithms domain.

    Coding & AlgorithmsOnsite
  • ShopifyMediumMachine Learning Engineer
    Implement a Capacity-Bounded Cache

    This question tests the ability to implement a Least Recently Used (LRU) cache, requiring efficient O(1) time complexity for both data retrieval and insertion through the combination of a hash map and a doubly linked list.

    Coding & AlgorithmsTechnical ScreenHash MapLinked ListCache
  • ShopifyMediumMachine Learning Engineer
    Implement an interactive CLI class with tests

    This question evaluates object-oriented design, command-line interface implementation, persistent state management, input validation and error logging, extensibility for new commands, comprehensive unit testing, and continuous integration configuration.

    Coding & AlgorithmsOnsite
  • ShopifyMediumMachine Learning Engineer
    Simulate a rover fleet

    This problem tests your ability to manage state in a 2D grid simulation, coordinate multiple entities with movement logic, and enforce collision-avoidance constraints.

    Coding & AlgorithmsTechnical ScreenSimulationGridCollision Detection
  • SiemensMediumMachine Learning Engineer
    Batch and Pad Variable-Length Vectors with Optional Final-Batch Dropping

    Implement an ordered data pipeline function that partitions variable-length numerical sequences into batches, applies batch-local right padding, handles empty vectors, and optionally discards incomplete final batches.

    Coding & AlgorithmsTechnical Screendata-pipelinesarraysmachine-learning
  • SnapchatMediumMachine Learning Engineer
    Determine Whether Courses Can Be Completed

    This question evaluates understanding of graph modeling, directed cycle detection, and dependency resolution in the context of course prerequisites. It is commonly asked in the coding & algorithms domain because it reveals a candidate's algorithmic problem-solving ability and practical application of graph algorithms (expected O(V+E) time), testing practical implementation skills rather than only conceptual theory.

    Coding & AlgorithmsTechnical Screen
  • SnapchatMediumMachine Learning Engineer
    Determine and print expression to reach target

    This question evaluates skill in constructing and evaluating arithmetic expressions, handling numerical stability (including division-by-zero and floating-point tolerance), and reasoning about combinatorial permutations of numbers and operators.

    Coding & AlgorithmsOnsite
  • SnapchatMediumMachine Learning Engineer
    Evaluate an Integer Arithmetic Expression String With Operator Precedence

    A coding problem to evaluate a string expression of non-negative integers with addition, subtraction, multiplication and integer division, respecting operator precedence and left-to-right order, with no parentheses and no eval. It tests parsing, precedence handling and truncating integer division.

    Coding & AlgorithmsTechnical Screen
  • SnapchatMediumMachine Learning Engineer
    Find K Nearest Points

    This question tests the ability to efficiently find the k-closest points to an origin in a 2D plane, focusing on heap-based or selection-based data structures.

    Coding & AlgorithmsOnsiteHeapGeometryQuickSelect
  • SnapchatMediumMachine Learning Engineer
    Find Shortest Clear Grid Path

    Solve the shortest clear path in an n by n binary grid using BFS in 8 directions. Covers blocked endpoints, visited marking, path length, correctness, complexity, and weighted-move follow-ups.

    Coding & AlgorithmsOnsite
  • SnapchatMediumMachine Learning Engineer
    Find all quadruplets summing to target

    This problem tests your ability to optimize nested loops using a two-pointer approach to achieve a time complexity better than brute force when searching for subsets of a fixed size that sum to a target value.

    Coding & AlgorithmsOnsiteArraysTwo PointersSorting
  • SnapchatHardMachine Learning Engineer
    Find the Smallest Range Covering K Sorted Lists

    Tests multi-pointer tracking and priority queue fundamentals to find the narrowest bounding interval containing at least one element from each of k sorted lists.

    Coding & AlgorithmsTechnical ScreenHeapSliding WindowGreedy
  • SnapchatHardMachine Learning Engineer
    Implement calculator and graph connectivity

    This question evaluates proficiency in parsing and arithmetic expression evaluation (including operator precedence and nested parentheses) alongside implementation of disjoint-set (Union-Find) data structures for computing graph connected components.

    Coding & AlgorithmsTechnical Screen
  • SnapchatHardMachine Learning Engineer
    Render an Organization Chart and Find Skip-Level Pairs

    Build and render an organization tree with ordered indentation, infer its root, and return exactly two-level manager-descendant pairs.

    Coding & AlgorithmsOnsite
  • SpotifyMediumMachine Learning Engineer
    Join Tables and Rank Users

    This question evaluates proficiency in SQL and data-engineering skills—specifically joins, aggregation and ranking via window functions, event deduplication, and query performance considerations across analytics tables.

    Coding & AlgorithmsOnsite
  • StackAdaptEasyMachine Learning Engineer
    Maintain the Median of an Integer Stream

    This problem tests your ability to maintain dynamic statistics in a data stream using efficient heap-based data structures.

    Coding & AlgorithmsTechnical ScreenHeapsData StreamsAlgorithms
  • StackAdaptMediumMachine Learning Engineer
    Rebuild a Binary Tree From Preorder and Inorder Sequences, Returned in Level Order

    Reconstruct a binary tree with distinct values from its preorder and inorder traversals and return it in level-order form with null markers. Tests how the two traversal orders pin down structure, careful index bookkeeping, and efficient handling of deep, skewed trees.

    Coding & AlgorithmsOnsite
  • Startups.ComMediumMachine Learning Engineer
    Implement common neural network layers in PyTorch

    This question evaluates proficiency in implementing core neural-network primitives (ReLU, numerically-stable Softmax, LayerNorm, BatchNorm with running statistics, and RMSNorm), numerical stability and normalization concepts, and understanding of autograd-compatible tensor operations.

    Coding & AlgorithmsOnsite
  • TeslaHardMachine Learning Engineer
    Compute suffix sums over waypoints

    This question evaluates a candidate's ability to compute geometric suffix sums over batched 2D trajectories, testing skills in array manipulation, Euclidean distance computation, and runtime-conscious algorithm design within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen