← Salesforce questions

Minimum steps in a grid

Filed under Salesforce

Given an M x N binary grid where 0 represents an empty cell and 1 represents an obstacle, find the shortest path from the top-left cell (0,0) to the bottom-right cell (M-1, N-1). You can move in four…

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

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