OpenAI·Software Engineer·Technical Phone Screen
Apr 2026
Got a pretty gnarly algorithmic problem at what seemed like a technical phone screen for a software engineer role at OpenAI. One question, lots of moving parts, and I left unsure if I'd even fully understood the problem statement by the time the call ended.
- You have an N×M grid where some cells start infected. Infection spreads to 4-directional neighbors one step per day, and an infected plant dies if it ever had K or more infected neighbors simultaneously within D days of getting infected. You can burn (permanently remove) exactly one row or one column at the start of any single day. Find the optimal day and row/column to burn in order to minimize total plant deaths.
“I spent the first few minutes just trying to re-read the problem back to the interviewer because I kept confusing the death condition with the spread condition.” The rest of the author's notes on Software Engineer interview at OpenAI, Technical Phone Screen round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post