Maze Solver with Path Printing

Early July, 2026

Late May, 2026

Question had 5 parts: part 1 (debug): path printing was invalid; start and end were being added to the path part 2 (debug): revisiting same cell; use a visited set part 3 (implementation): Some cells are chutes (one way); need to update valid cell logic part 4 (implementation): Keys and Gates, acquires keys to pass through gates; update BFS to maintain key state. Discussed time/space complexity and optimization with bitmap (was not asked to ask implement bitmap, plenty of time was left) part 5a (implementation): Something to do with a medusa that you want to avoid. part 5b ????

Mid May, 2026

Interview had multiple extensions on a grid/BFS problem. * First, without AI help, I fixed a bug in `cell.Type` logic quickly. Interviewer pushed for a cleaner solution without hardcoded strings/constants. * Then AI was enabled. I identified and explained a BFS bug related to printing the solution path and fixed it with AI assistance. * Added support for direction characters like `<` and `>`, which AI implemented based on my instructions. * Next, implemented key-lock logic (`a -> A`, `b -> B`) by extending visited state to also track collected keys/state. * Final follow-up was only discussion based: avoiding movement toward a “Medusa” if in the same row/column. Final verdict: Not selected. Not sure if this round became a concern despite completing most parts.