Medium

Gated Maze Pathfinder AI-Assisted Coding Interview

Repair a flawed maze traversal and implement shortest-path search where directional gate cells constrain legal movement.

Mock Interview with AI

1. Problem Statement

Inspect the maze code for defects, then implement the shortest legal path through directional gates. Explain your approach before asking the AI assistant for code.

2. Live Coding Format

Work in the provided coding workspace while explaining your decisions to the live interviewer. Validation may use inline tests, examples, comments, or a verbal walkthrough.

3. Key Focus Areas

1
Bug identification
2
Algorithm selection
3
Gate semantics
4
Assistant output review
5
Complexity reasoning

4. What Strong Candidates Should Demonstrate

✓Inspect existing code before asking an assistant to extend it.
✓Select BFS for an unweighted shortest-path problem and explain why.
✓Validate directional movement constraints with concrete traces.

Want interactive feedback?

Practice this problem in the live coding workspace while the interviewer probes your clarification, implementation, trade-offs, and validation.

Start Interview

Core Concepts

Breadth-First SearchDebuggingGraph TraversalAI-Assisted Verification