Solution: Reaching Points
Let's solve the Reaching Points problem using the Modified Binary Search pattern.
We'll cover the following...
We'll cover the following...
Statement
Given four integers sx, sy, tx, and ty, determine whether it is possible to transform the point (sx, sy) into the point (tx, ty) through any number of operations. Return true if such a transformation is possible, or false otherwise.
At each step, a point (x, y) can be transformed into either (x, x + y) or (x + y, y).
Constraints:
sx,sy,tx,ty...