โ† Salesforce questions

Minimum steps on Cartesian plane grid game

Filed under Salesforce

Given a grid of size M x N, find the minimum number of steps to reach (M-1, N-1) from (0, 0) using allowed jump vectors.

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.