BETA

Difficulty Level:

Easy

Total Submissions: 1193 Accuracy:

12.49%

Points in Straight Line (Function Problem)
     

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.

** For More Input/Output Examples Use 'Expected Output' option **


					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.