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 31–60 of 253 results
- AtlassianHardMachine Learning EngineerFind 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 - BeaconfireEasyMachine Learning EngineerCheck Whether a String Is Built by Repetition
This problem tests your ability to detect periodic string patterns using string manipulation or mathematical properties, specifically focusing on efficient substring identification.
Coding & AlgorithmsTechnical ScreenStringsPattern MatchingAlgorithms - ByteDanceHardMachine Learning EngineerCombined Median of Two Sorted Integer Lists in Logarithmic Time
From a ByteDance technical screen for a machine learning engineer role: given two sorted integer arrays, return the median of all their elements combined, averaging the two middle values when the total count is even. It tests reasoning about sorted order under a logarithmic time target and edge cases such as an empty array.
Coding & AlgorithmsTechnical Screen - ByteDanceHardMachine Learning EngineerCount 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 - ByteDanceMediumMachine Learning EngineerMaximize total catch over K hours from ponds whose yield drops after each hour
Given the current hourly catch of each fishing pond and a budget of K hours, where every hour fished at a pond lowers its catch by one, compute the maximum total number of fish. It tests modeling the declining yields, choosing an optimal schedule, and meeting a time bound better than O(K log N) when K is very large.
Coding & AlgorithmsTechnical Screen - ByteDanceHardMachine Learning EngineerMinimum Number of Rooms to Host a Set of Possibly Overlapping Meetings
Given meetings as half-open start and end time intervals, compute the minimum number of rooms needed so that no room ever hosts two overlapping meetings. Tests interval reasoning, correct handling of back-to-back meetings that share an endpoint, and an efficient approach for up to 100,000 meetings.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumMachine Learning EngineerReverse a Linked List in Groups of K
This problem tests your ability to manipulate pointers in a linked list structure and manage iterative or recursive state transitions for fixed-size segments.
Coding & AlgorithmsTechnical ScreenLinked ListPointersAlgorithms - CadenceMediumMachine Learning EngineerImplement Depth-First Search Traversal
This problem tests your ability to implement a recursive or iterative depth-first search (DFS) while managing state to handle cycles in a graph represented as an adjacency list.
Coding & AlgorithmsTechnical ScreenGraphsDFSRecursion - Capital OneHardMachine Learning EngineerCompute minutes since last train departure
This problem tests your ability to manipulate time objects, handle cyclic day-wrap scenarios, and perform efficient searching on sorted lists.
Coding & AlgorithmsOnline AssessmentArraysSortingTime Complexity - Capital OneMediumMachine Learning EngineerImplement string/matrix simulations and counting pairs
This problem tests string manipulation, simulation of grid-based gravitational collapse, and efficient combinatorial counting of string combinations.
Coding & AlgorithmsOnline AssessmentStringsSimulationHashing - Capital OneMediumMachine Learning EngineerMaximize grid-path expression and count sawtooth subarrays
This multi-part question evaluates dynamic programming and state management for constrained grid traversal with left-to-right expression evaluation, alongside parity-based array analysis and combinatorial counting of contiguous subarrays.
Coding & AlgorithmsHR Screen - Capital OneMediumMachine Learning EngineerReturn 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 - Capital OneMediumMachine Learning EngineerRotate matrix and find max lamp coverage
This question evaluates array and matrix manipulation, in-place algorithm design, interval processing (sweep-line) and interval merging skills, testing competencies in algorithm design, complexity analysis, and robust edge-case reasoning within the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - Capital OneMediumMachine Learning EngineerSimulate round-robin package assignment to servers
This problem tests array indexing manipulation and logic for stateful resource allocation, specifically handling circular queues with dynamic availability constraints.
Coding & AlgorithmsOnline AssessmentArraysSimulationQueueing - Capital OneMediumMachine Learning EngineerSolve Four Coding Assessment Tasks
This multi-part coding question evaluates array manipulation, algorithm simulation, deterministic spatial placement, and constrained optimization competencies across tasks involving cumulative thresholds, iterative subtraction sequences, fixed-shape grid placement, and minimal-increment adjustments for monotonic patterns.
Coding & AlgorithmsOnline Assessment - Capital OneEasyMachine Learning EngineerSolve OA tasks on string, grid path, subarrays
This problem tests proficiency in string manipulation, grid traversal with condition-based movement, and linear-time subarray analysis.
Coding & AlgorithmsOnline AssessmentArraysDynamic ProgrammingGrid Traversal - Capital OneHardMachine Learning EngineerSupport updates and count target-sum pairs
This problem tests the ability to maintain frequency counts of elements in a dynamic dataset and perform efficient range-sum queries for pairs that satisfy a target condition.
Coding & AlgorithmsOnline AssessmentHash MapData StructuresFrequency Array - CognitivMediumMachine Learning EngineerMaintain a Streaming Median
This question evaluates understanding of streaming algorithms and dynamic data structures for maintaining order statistics, along with analysis of time complexity and memory trade-offs.
Coding & AlgorithmsTechnical Screen - CohereMediumMachine Learning EngineerImplement 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 - CoinbaseHardMachine Learning EngineerImplement local maxima, bagging, and k-means
This problem tests array traversal for local maxima detection, statistical resampling techniques for bagging, and iterative convergence for k-means clustering.
Coding & AlgorithmsOnline AssessmentAlgorithmsClusteringEnsemble Methods - CoinbaseMediumMachine Learning EngineerWrite 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 EngineerDelete 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 - DatabricksMediumMachine Learning EngineerDesign In-Memory QPS Counter
This question evaluates the ability to design and implement an in-memory time-series counter and sliding-window aggregation, emphasizing efficient data structures, handling high-frequency events, and memory-time trade-offs.
Coding & AlgorithmsTechnical Screen - DeshawMediumMachine Learning EngineerImplement sqrt and parity-based array rearrangement
In the Coding & Algorithms domain, this prompt evaluates numerical methods and precision handling for implementing a square-root function without library support, together with in-place array manipulation, partitioning and complexity reasoning for parity-based rearrangement, testing competencies in algorithm design, numerical approximation, and space-efficient data transformations. These problems are commonly asked to assess understanding of numerical stability, error bounds and iterative approximation as well as mastery of in-place ordering/partitioning strategies and time/space complexity analysis, requiring both conceptual understanding of mathematical properties and practical implementation ability.
Coding & AlgorithmsTechnical Screen - DoorDashMediumMachine Learning EngineerFind 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 - DoorDashMediumMachine Learning EngineerMinimize batches and allocate riders by time
This problem tests your ability to optimize resource scheduling by grouping tasks with overlapping time windows into the minimum number of batches, subject to capacity constraints.
Coding & AlgorithmsTechnical ScreenGreedyIntervalsBin Packing - FigmaMediumMachine Learning EngineerImplement 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 EngineerMerge 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 - GeneralmotorsHardMachine Learning EngineerCount Islands in a Grid
This problem tests your ability to navigate a 2D grid and identify distinct connected components using graph traversal techniques like Depth-First Search (DFS) or Breadth-First Search (BFS).
Coding & AlgorithmsTechnical ScreenGraphsDFSBFS - GleanMediumMachine Learning EngineerDecide 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
Atlassian
Capital One
Cohere
Coinbase
Databricks
DoorDash
Figma
Glean