  Showing: Handle Score
@Ibrahim Nash 5725
@akhayrutdinov 5111
@mb1973 4989
@Quandray 4908
@saiujwal13083 4156
@sanjay05 3762
@marius_valentin_dragoi 3511
@sushant_a 3453
@KshamaGupta 3318
@the_coder95 3302
Points in Straight Line
Easy Accuracy: 20.83% Submissions: 4277 Points: 2

Given N points on a 2D plane, your task is to complete the function maxPoints which returns an integer denoting the maximum number of points which lie on the same straight line.

Input:
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow . Each test case contains an integer N denoting the total no of points. And then in the next line are the N space separated values X[i] denoting the X coordinates of the ith point and then in the next line are N space separated values Y[i] denoting the Y coordinates of the ith point.

Output:
For each test case in a new line output will be the count of  maximum number of points that lie on the same straight line.

Constraints:
1<=T<=100
1<=N<=50

Example(To be used only for expected output):
Input:

2
2
1 1
2 2
3
0 0 0
4 5 6
Output:
2
3

Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

### Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

#### My Submissions:  