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

2

3

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

Anirban166 | 375 |

Sathvik Avasarala | 308 |

abducodes | 285 |

KunalKrSingh | 279 |

UtkarshMalik | 270 |

Pulkit__Sharma__ | 618 |

Anirban166 | 503 |

abducodes | 446 |

Found_me | 425 |

Md Asif | 372 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4559 |

Login to report an issue on this page.