Debug and extend a maze solver through progressive graph search with follow-up questions like movement-rule, and state-tracking tasks. Recently seen in Meta AI-enabled interviews

Maze Solver

Build and optimize a subset solver that maximizes unique characters under Meta-style performance pressure.

Max Unique Characters Subset

README.md

cell_type.h

main.cpp

maze.cpp

maze.h

mazes.cpp

mazes.h

position.h

solver.cpp

solver.h

test_framework.h

test_helpers.h

test_part1_rendering.cpp

test_part2_solver.cpp

test_part3_directional.cpp

test_part4_keys_and_doors.cpp

tests

CellType.cs

Maze.cs

Mazes.cs

Position.cs

Solver.cs

Assertions.cs

TestAttribute.cs

TestHelpers.cs

TestPart1Rendering.cs

TestPart2Solver.cs

TestPart3Directional.cs

TestPart4KeysAndDoors.cs

TestRunner.cs

CellType.java

Main.java

Maze.java

Mazes.java

Position.java

Solver.java

Assertions.java

Test.java

TestHelpers.java

TestPart1.java

TestPart2.java

TestPart3.java

TestPart4.java

TestRunner.java

main.js

maze.js

mazes.js

solver.js

helpers.js

part1.test.js

part2.test.js

part3.test.js

part4.test.js

main.py

maze.py

mazes.py

requirements.txt

solver.py

__init__.py

helpers.py

test_part1_rendering.py

test_part2_solver.py

test_part3_directional.py

test_part4_keys_and_doors.py

Maze Path Rendering

Maze Solver Correctness

Directional Passages

Keys and Locked Doors