InterviewDigestTechnical2026-08-13
Graph problems (BFS focused)
AI-Expanded — inferred from the question title, not from the original candidate report
Given a grid representing a map of land and water, where '1' represents land and '0' represents water, write a function to find the length of the shortest path between two given coordinates. You must use a Breadth-First Search algorithm to navigate only through land cells and return the minimum number of steps required to reach the destination, or -1 if no path exists.
Context & Summary
Technical interview focusing on DSA, Java, Spring Boot, and previous project experience
💻 Coding practice works best on desktop.
Code editors are too cramped on mobile screens.
Conceptual Question
This appears to be a conceptual, design, or behavioral question rather than an algorithmic coding problem. The code editor and automated test cases have been disabled for this question.
Back to questions