← Swiggy questions
CodingHard

Reachability in 2D Boolean Matrix with Diagonal Moves

Filed under Swiggy

Given a 2D boolean matrix representing grid cells where 1s are obstacles and 0s are accessible, determine if destination point B can be reached from source point A. Allowed movements from current cell…

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 Swiggy questions

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