All Problems

Problem title

Difficulty

Avg time to solve

Distinct Paths

Moderate

20 mins

Sorting Of A Rotated Sorted Array

Easy

10 mins

Longest Common Subsequence

Moderate

--

Sub-Matrix with Sum Zero

Moderate

35 mins

Maximum Length of Chain

Moderate

15 mins

3 Divisors

Moderate

25 mins

Angle Between Hour Hand And Minute Hand

Easy

15 mins

Remove maximum edges

Easy

15 mins

Sorted Subsequence of Size 3

Moderate

15 mins

Check Square

Moderate

10 mins

Problem

Submissions

2

Avg. time to solve

10 min

Success Rate

90%

Problem Statement

```
Let the input be [1,0,2,1] and [0,1,1,2].
So, the coordinates of the four points be [ {1, 0}, {0, 1}, {2, 1}, {1, 2} ]
```

```
From the above image, we can see that it is a square. Thus, the output will be ‘Yes’.
```

```
The first line of input contains an integer ‘T’ denoting the number of test cases.
The first line of each test case contains four space-separated integers representing x-coordinates of the four points.
The second line of each test case contains four space-separated integers representing y-coordinates of the four points.
```

```
For each test case, print ‘Yes’ if four points make a square otherwise print ‘No’.
```

```
Don’t print anything, just return True if four points make a square otherwise return False.
```

```
1 <= T <= 10^4
-10^9 <= xi, yi <= 10^9
Time limit: 1 sec
```

```
2
1 0 2 1
0 1 1 2
1 0 0 1
1 0 1 2
```

```
Yes
No
```

```
Test Case 1: Refer to the example described above.
Test Case 2:
The quadrilateral for the given four points is represented below.
```

```
As we can clearly see this is not a square. Thus, the answer will be ‘No’.
```

```
2
1 2 4 2
0 2 4 2
0 1 2 3
1 -1 2 0
```

```
No
Yes
```

Java (SE 1.8)

Console

Sample Test Case

Custom Test Case

Download Test Cases

Test Case 1

Test Case 2

Test Case 3

Saving Code...

Full Screen Mode

Change Theme

Solution submission not allowed

Save Code

Reset Code