OpenAI Machine Learning Engineer Coding & Algorithms Interview Questions
Practice 18 real Coding & Algorithms interview questions for Machine Learning Engineer roles at OpenAI.

"I got asked a hardcore MCM DP question and I saw it on PracHub as well. Solved that question in 5 minutes. Without PracHub I doubt I could solve it in 5 hours. Though somehow didn't get hired, perhaps I guess I solved it too fast? /s"

"Believe me i'm a student here jn US. Recently interviewed for MSFT. They asked me exact question from PracHub. I saw it the night before and ignored it cause why waste time on random sites. I legit wanna go back and redo this whole thing if I had chance. Not saying will work for everyone but there is certainly some merit to that website. And i'm gonna use it in future prep from now on like lc tagged"

"10 years of experience but never worked at a top company. PracHub's senior-level questions helped me break into FAANG at 35. Age is just a number."

"I was skeptical about the 'real questions' claim, so I put it to the test. I searched for the exact question I got grilled on at my last Meta onsite... and it was right there. Word for word."

"Got a Google recruiter call on Monday, interview on Friday. Crammed PracHub for 4 days. Passed every round. This platform is a miracle worker."

"I've used LC, Glassdoor, and random Discords. Nothing comes close to the accuracy here. The questions are actually current — that's what got me. Felt like I had a cheat sheet during the interview."

"The solution quality is insane. It covers approach, edge cases, time complexity, follow-ups. Nothing else comes close."

"Legit the only resource you need. TC went from 180k -> 350k. Just memorize the top 50 for your target company and you're golden."

"PracHub Premium for one month cost me the price of two coffees a week. It landed me a $280K+ starting offer."

"Literally just signed a $600k offer. I only had 2 weeks to prep, so I focused entirely on the company-tagged lists here. If you're targeting L5+, don't overthink it."

"Coaches and bootcamp prep courses cost around $200-300 but PracHub Premium is actually less than a Netflix subscription. And it landed me a $178K offer."

"I honestly don't know how you guys gather so many real interview questions. It's almost scary. I walked into my Amazon loop and recognized 3 out of 4 problems from your database."

"Discovered PracHub 10 days before my interview. By day 5, I stopped being nervous. By interview day, I was actually excited to show what I knew."

"I recently cleared Uber interviews (strong hire in the design round) and all the questions were present in prachub."
"The search is what sold me. I typed in a really niche DP problem I got asked last year and it actually came up, full breakdown and everything. These guys are clearly updating it constantly."
Simulate Infection Spread on a Grid
This question evaluates the ability to implement and reason about discrete-time, grid-based simulations with multi-state cells and neighbor-dependent ...
Find Minimum Compatible Version
This question evaluates binary search, monotonic predicates, careful version ordering, and cost-aware optimization of expensive compatibility checks. ...
Streaming Entropy with Numerical Stability
This question tests a candidate's ability to implement numerically stable online algorithms for computing Shannon entropy over streaming data. It eval...
Design an Editable Text Buffer
This question evaluates data structure design, mutable state management, undo/redo semantics, and prefix-based autocomplete indexing with dynamic freq...
Track Expiring GPU Credits
This question evaluates event-replay and time-window accounting skills, including temporal data structures, priority-based consumption, out-of-order e...
Compute time to infect all cells
You are given an n × m grid representing people in a city. - Each cell is either infected (1) or healthy (0). - Two cells are neighbors if they share ...
Simulate Plant Infection With Controlled Burning
You are given an R by C grid of plants. Each plant is initially healthy, infected, recovered, or dead. A plant has up to four orthogonal neighbors. De...
Simulate Grid Infection
This question evaluates skills in multi-source breadth-first search, synchronous simulation updates, boundary handling, and off-by-one correctness wit...
Simulate Turn-Based Monster Battles
This question evaluates the ability to implement a turn-based battle simulation with correct state management, turn semantics, knockout handling, dama...
Schedule Incremental Labeling Tasks
This question evaluates skills in designing stateful incremental schedulers, fairness and load-balancing algorithms, deterministic tie-breaking, and e...
Find earliest supporting dependency version
Question Given a list of dependency versions (e.g. [103.003.02, 103.003.03, 203.003.02]) and a black-box API isSupported(v), design an algorithm to fi...
Infer Generic Return Types
This question evaluates understanding of type systems, generic unification, recursive data structures, substitution mechanics, and robust error handli...
Search Monster Battle Strategies
This question evaluates algorithmic problem-solving around deterministic simulation and state-space exploration, focusing on handling transient state ...
Find the First Working Version
This question evaluates understanding of search algorithms, version normalization, and monotonic predicates, along with competency in parsing and orde...
Find earliest supporting version under constraints
You are given version strings formatted as {major}.{minor}.{patch}, e.g., "103.003.03". Each version either supports a feature or not. You may call is...
Design a Resumable Iterator with Checkpoint and Restore
Design a resumable iterator: an iterator that can serialize its current position into a compact, opaque checkpoint and later be reconstructed from tha...
Implement in-memory database insert and delete operations
Design and implement a simple in-memory database (key-value store) that supports the following operations: - insert(key, value): Insert a key-value pa...
Simulate Plant Infection Spread
This question evaluates graph traversal and grid-based simulation skills, including modeling a 2D grid as a graph, propagation dynamics with obstacles...