Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6379 |

@blackshadows | 6329 |

@mb1973 | 5376 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3357 |

@KshamaGupta | 3318 |

Complete Leaderboard | |

Handle | Score |

@184025 | 108 |

@terabaap123 | 97 |

@anamikaprasad124 | 92 |

@arshjit_singh7 | 92 |

@kumsachin10 | 90 |

@vaibhavinayak | 75 |

@TanmayJ | 74 |

@NullPointerException | 74 |

@ronaldo77 | 72 |

@bhupindersingh25122001 | 68 |

@ritiksethi21 | 68 |

Complete Leaderboard |

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

Login to report an issue on this page.

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

Yes
Points in Straight Line

...