Meta·Software Engineer·Onsite - Coding / Algorithms
Jul 2026
Meta SWE coding round with a multi-part grid maze problem. Four sub-questions building on the same grid setup, reachability through path counting. The layered structure felt intentional, like they were watching how you extend a solution rather than just whether you could solve it.
- Given an m x n grid where cells are either free or blocked, and a start and target position, answer four sub-questions in sequence: (1) is the target reachable from the start, (2) what is the shortest number of steps to reach it, (3) return one valid shortest path as a coordinate list, and (4) count the total number of distinct shortest paths.
“The first two parts were fine, BFS is BFS.” The rest of the author's notes on Software Engineer interview at Meta, Onsite - Coding / Algorithms round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post