Minimum Steps to Target Number via Modular Addition

OAOpenAILast reported November 2025Low Frequency
Reported
1× across candidate reports
First seen
November 2025
Last reported
November 2025
Reported outcome
unknown

Problem Overview

OpenAI online assessment question, reconstructed from 1 candidate report (November 2025). Tests: BFS shortest path.

  • The full problem statement — full requirements, constraints, and edge cases
  • Approach and trade-offs — what passing candidates did, and the mistakes that sink people
Unlock the full OpenAI catalog
Full problem statements, candidate-reported follow-ups, and walkthroughs — for every OpenAI question.
Unlock with Pro
Already a member? Sign in
Verified Source
Every question is reconstructed from multiple independent candidate reports. Follow-ups candidates reported, not invented ones.
Codex Fact-Checked
Technical claims, formulas, and scale numbers are reviewed against primary sources.
Interviewer Follow-ups
The follow-ups candidates reported, with the trigger that prompts each one — plus the mistakes that sink people.
Is this helpful?