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.
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.
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.
Example(To be used only for expected output):
0 0 0
4 5 6
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.
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes