Minimum steps in a binary matrix
Filed under Samsung
The question
Find the minimum number of steps to reach from cell (1, 1) to (N, M) in a matrix of 1s and 0s (where 0 is blocked, 1 is safe) moving in 4 directions.
No write-up yet. Related questions below have one.
Related Samsung questions
Collected from public candidate posts and coding forums. Updated Nov 2026.