1p3a_oj Question

Progressive Maze Solver (Fix Tests → BFS Shortest Path → Movement Constraints → Keys & Doors)

Question Details

Problem: Progressive Maze Solver (AI-enabled coding / given codebase) You are given an existing maze-solver codebase with unit tests. The maze is a 2D grid: S: start E: exit/target

Full Details

🔒

Unlock all Meta questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a reported interview question from a meta interview for a swe role during the coding round.

It covers the following topics: Graphs, Bit Manipulation, Graph, Matrix .