Available question text
Given start (sx,sy) and target (tx,ty) on an infinite grid where each move adds m = max(x,y) to either x or y, determine the minimum number of such monotone increases to reach (tx,ty) (or return -1 if unreachable). Constraints up to 1e9 force a mathematical/greedy reasoning about reachability and step counts rather than brute force.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3609. Minimum Moves to Reach Target in Grid
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source