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 121–150 of 253 results
- MetaMediumMachine Learning EngineerRead Current and Historical Field Values with Expiration
Design an in-memory key-field-value store that supports historical queries, time-to-live (TTL) expiration, and field deletions without corrupting past states.
Coding & AlgorithmsOnline AssessmentBinary SearchDesignHash Table - MetaHardMachine Learning EngineerSimulate Monster Team Battles
This question tests the ability to implement a stateful, turn-based simulation engine using object-oriented principles, efficient queue management, and rule-based damage calculations.
Coding & AlgorithmsTechnical ScreenSimulationObject-Oriented DesignSorting - MetaEasyMachine Learning EngineerSolve Tree Views, Columns, and Calculator
This problem tests your ability to perform recursive binary tree traversals to extract horizontal and vertical views, followed by implementing a stack-based parser to handle mathematical expressions with standard order of operations.
Coding & AlgorithmsOnsiteBinary TreesBFSStack - MetaEasyMachine Learning EngineerSolve four OA string/array/matrix/graph tasks
This problem tests foundational proficiency in four distinct domains: string processing, array simulation, matrix transformation, and graph traversal.
Coding & AlgorithmsOnline AssessmentStringsSimulationBFS - MetaMediumMachine Learning EngineerSolve linked list, tree, and grid problems
This set evaluates mastery of core data structures and algorithmic reasoning across singly linked lists (cycle entry detection), binary search trees with parent pointers (in-order successor), constant-time state tracking for n×n game boards, and grid connectivity for maximizing component size, emphasizing pointer manipulation, traversal logic, state-design, and component analysis. Commonly asked to gauge proficiency in Coding & Algorithms and complexity analysis, these problems test both conceptual understanding of traversal and connectivity principles and practical application of space- and time-efficient implementations under typical interview constraints.
Coding & AlgorithmsOnsite - MetaMediumMachine Learning EngineerSolve matrix components, median, and traversals
This question evaluates algorithmic problem-solving across grid and graph algorithms, selection algorithms, and traversal techniques—specifically connected-component detection in binary matrices, median-finding across two sorted arrays, and BFS/DFS traversal variants—measuring competence in data structures, complexity analysis, and handling edge cases. Commonly asked in Coding & Algorithms interviews for Machine Learning Engineer roles, it assesses efficiency and correctness concerns such as time and space complexity and traversal orders, testing both conceptual understanding of algorithmic principles and practical implementation distinctions like iterative versus recursive variants.
Coding & AlgorithmsTechnical Screen - MetaMediumMachine Learning EngineerSolve matrix diagonal and sliding-window statistics
Solve matrix diagonal and sliding-window statistics evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - MetaEasyMachine Learning EngineerSolve two linked list/array tasks
This problem tests your ability to manipulate linked list pointers to detect cycles and solve a classic array-based problem using the two-pointer technique to find specific target sums.
Coding & AlgorithmsTechnical ScreenLinked ListTwo PointersArrays - MicrosoftMediumMachine Learning EngineerFind Top K Largest Elements
This question tests the ability to efficiently find the K largest elements in an unsorted array while managing time complexity constraints through heap-based or selection-based algorithms.
Coding & AlgorithmsTechnical ScreenArraysHeapSorting - MicrosoftMediumMachine Learning EngineerFind pairs with the minimum absolute difference
This question evaluates array manipulation, sorting-based reasoning, and the ability to generate ordered value pairs that reflect minimum absolute differences while handling ordering and duplicates.
Coding & AlgorithmsTechnical Screen - MicrosoftMediumMachine Learning EngineerFind the Lowest Common Ancestor in a Binary Search Tree
This problem tests the ability to leverage the Binary Search Tree (BST) property to efficiently locate the Lowest Common Ancestor (LCA) of two nodes.
Coding & AlgorithmsHR ScreenBSTTreesRecursion - MicrosoftMediumMachine Learning EngineerFind the Lowest Common Ancestor in a Binary Tree
This problem tests tree traversal techniques and recursion logic to identify the deepest node that is an ancestor to two specified nodes in an arbitrary binary tree.
Coding & AlgorithmsHR ScreenTreesRecursionDFS - MicrosoftMediumMachine Learning EngineerImplement K-Means and Detect Divisible Subarrays
This question evaluates a candidate's ability to implement an iterative clustering algorithm (K-means) and to reason about subarray sums modulo k, testing competencies in numerical computation, centroid management, edge-case handling, and efficient algorithm design.
Coding & AlgorithmsOnsite - MicrosoftMediumMachine Learning EngineerImplement SFT Sample Packing
This problem tests your ability to efficiently pack variable-length sequences into fixed-length blocks for training, ensuring padding tokens do not influence the loss calculation.
Coding & AlgorithmsHR ScreenNLPData PreprocessingArrays - MicrosoftMediumMachine Learning EngineerImplement cache and merge intervals
This question tests the ability to implement a fixed-capacity Least Recently Used (LRU) cache using hash maps and doubly-linked lists, followed by a classic interval processing algorithm to merge overlapping segments.
Coding & AlgorithmsOnsiteLRU CacheIntervalsHash Map - MicrosoftMediumMachine Learning EngineerReturn the k most frequent values in an array with a deterministic tie rule
Return the k values that occur most often in an integer array, ranked by frequency with ties broken by the smaller value. It tests frequency counting, selecting the top k efficiently and producing a deterministic order when several values tie at the cutoff.
Coding & AlgorithmsTechnical Screen - 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 - 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 - 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 - NextdoorMediumMachine Learning EngineerBuild Ranked Feed With Photo Batching
This question evaluates algorithmic reasoning and data manipulation skills, including stable sorting, grouping/batching, and merging of ranked items while preserving ordering invariants.
Coding & AlgorithmsTechnical Screen - NextdoorMediumMachine Learning EngineerImplement ordering with dependency constraints
This question evaluates understanding of dependency resolution and ordering within graph-based problems, including cycle detection, lexicographic tie-breaking, and extensions requiring certain items to appear as contiguous groups.
Coding & AlgorithmsTechnical Screen - NextdoorMediumMachine Learning EngineerMerge overlapping weekly time intervals
This question evaluates the ability to parse weekday and 24-hour time strings, reason about interval overlap, and apply efficient merging and sorting techniques for time-based intervals.
Coding & AlgorithmsTechnical Screen - NuroHardMachine Learning EngineerFind Maximum Path Sum in N-ary Tree
This question evaluates understanding of tree traversal and aggregation techniques, including handling of variable-arity nodes, negative values, and path-based dynamic programming on N-ary trees.
Coding & AlgorithmsTechnical Screen - OpenAIMediumMachine Learning EngineerDesign a Resumable Iterator with Checkpoint and Restore
This question evaluates a candidate's ability to design serializable, stateful abstractions in both in-memory and I/O-bound contexts. It tests understanding of iterator patterns, checkpoint-restore semantics, and test-driven development — competencies commonly assessed in engineering roles requiring systems thinking and API design rigor.
Coding & AlgorithmsTechnical Screen - OpenAIMediumMachine Learning EngineerDesign an Editable Text Buffer
This problem tests your ability to design an efficient data structure for text manipulation while implementing undo/redo history and a dynamic prefix-based autocomplete feature.
Coding & AlgorithmsTechnical ScreenData StructuresTrieUndo-Redo - OpenAIMediumMachine Learning EngineerFind Minimum Compatible Version
Implement an algorithm to find the earliest compatible software version while minimizing expensive compatibility-check API calls across partitioned version branches.
Coding & AlgorithmsOnsiteBinary SearchAlgorithmsOptimization - OpenAIMediumMachine Learning EngineerFind the First Working Version
This question tests the ability to combine custom comparison logic with a binary search approach to identify the first transition point in a monotonic sequence.
Coding & AlgorithmsOnsiteBinary SearchAlgorithmsOptimization - OpenAIHardMachine Learning EngineerImplement in-memory database insert and delete operations
This question evaluates understanding of data structures and algorithmic complexity in the context of designing a key-value in-memory database, and it falls under the Coding & Algorithms domain for a Machine Learning Engineer role while focusing on practical implementation skills.
Coding & AlgorithmsOnsite - OpenAIMediumMachine Learning EngineerInfer Generic Return Types
Implement a toy type-inference engine that unifies generic parameter types with concrete argument types and substitutes resolved type variables to determine the return type.
Coding & AlgorithmsOnsiterecursiontreetype-systems - OpenAIHardMachine Learning EngineerSchedule Incremental Labeling Tasks
This problem tests the ability to design an incremental task scheduler that balances workload across a pool of annotators while maintaining fairness and deterministic state transitions.
Coding & AlgorithmsOnsiteHeapsSchedulingGreedy
Meta
Microsoft
Netflix
Nextdoor
Nuro
OpenAI