Solve maze tasks and compute shortest routes
Company: Meta
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Onsite
Overview: This multi-part question evaluates proficiency in grid-based pathfinding and shortest-path reasoning, debugging and incremental code extension, handling weighted or multi-target graph variants, ordered route planning across multiple targets, and array-based techniques for detecting duplicate and missing elements, situating it within the coding & algorithms domain that spans graph theory and array/data-structure problems. It is commonly asked to assess both practical implementation ability and algorithmic reasoning under constraints (such as large grids and input sizes), testing conceptual understanding of search and complexity trade-offs as well as practical application and optimization in code.
Read the full Meta Software Engineer interview experience this question came from