Problem title
Difficulty
Avg time to solve

Convex polygon
Hard
15 mins
Smallest String After Ordered Operations
Easy
15 mins
Maximize The Nice Divisor
Moderate
25 mins
Ayush and Expression
Moderate
25 mins
Black Friday
Easy
15 mins
Number, and it’s double.
Easy
15 mins
Largest Merge Of Two Strings
Moderate
15 mins
Nobita’s Assignment
Moderate
30 mins
Ninja's Encryption
Easy
15 mins
Ninja World Tournament
Easy
10 mins
2

Reaching Points

Difficulty: MEDIUM
Contributed By
Naresh |Level 1
Avg. time to solve
30 min
Success Rate
70%

Problem Statement

Given a starting point (startX, startY) and target point(endX, endY) . Return true if there is a sequence of moves to transform the starting point into the ending point. In one move you can transform (x, y) to either (x + y, y) or (x, x + y).

Input Format
The first line of input contains an integer ‘T’ denoting the number of test cases.

The next ‘T’ lines represent the test cases.

The first and the only line of each test case contains 4 integers startX,startY,endX, and endY.
Output Format
For each test case, print true if there is a sequence of moves to transform the starting point into the ending point, otherwise print false.
Note:
You do not need to print anything, it has already been taken care of. Just implement the given function.
Constraints
1 <= ’T’ <= 50
1 <= ’startX’, ’startY’, ’targetX’, ’targetY’ <= 10^9
‘startX’, ’startY’ denotes starting coordinates.
‘endX’, ’endY’ denotes target  coordinates. 

Time Limit: 1 sec
Sample Input 1
2
1 1 5 8
3 5 7 9
Sample Output 1:
true  
false  

Explanation For Sample Input 1:

For the first test case, the sequence of moves
(1,1)->(2,1)
(2,1)->(2,3)
(2,3)->(5,3)
(5,3)->(5,8)
Hence the answer for this case is true.

For the second test case, there is not a possible sequence to reach the final points.
Sample Input 2
2
1 1 1 1000
1 1 1000 1
Sample Output 2
true
true
Reset Code
Full screen
copy-code
Console