โ† Informatica questions

BFS shortest path in matrix

Filed under Informatica

Given a 2D matrix of characters or integers representing open paths and obstacles, find the shortest path from a given start cell to a target end cell using Breadth-First Search.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Informatica questions

Collected from public candidate posts and coding forums. Updated Nov 2026.