Blind Maze Escape with a Fixed Command Sequence

google

Given a maze where:

  • # is a wall,
  • . is a walkable cell,
  • E is the only exit.

You start from an unknown walkable cell: any . may be the initial position. During execution, you cannot ...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: