Problem Overview
Given an m×n grid where each cell is one of '.', '#', or '', find the shortest path that visits all '' cells. Movement is allowed in 4 directions: up, down, left, and…
Unlock the full OpenAI catalog
Full problem statements, candidate-reported follow-ups, and walkthroughs — for every OpenAI question.
Unlock with ProAlready a member?
Sign in