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.