Leetcode 780. Reaching Points

Given start (sx, sy) and target (tx, ty) where each move adds one coordinate to the other, determine if the target can be reached from the start; the key is to reverse the process and use Euclidean-style subtraction/modulo steps to efficiently jump back from (tx, ty) toward (sx, sy) for large coordinates.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 780. Reaching Points

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact