Find maximum collinear points

Q: Find maximum collinear points

This question evaluates understanding of planar geometry and algorithmic reasoning for identifying collinearity, including handling duplicate points and edge cases in integer coordinates.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Loading...

Given a list of 2D points with integer coordinates, return the maximum number of points that lie on the same straight line.

Input

points : a list of n points, where each point is [x, y] .

Output

An integer: the maximum count of points that are collinear.

Constraints

1 <= n <= 2000
Coordinates are integers in a reasonable range (e.g., [-10^4, 10^4] ).
Duplicate points may exist.

Notes

Lines can be vertical, horizontal, or any slope.
The result should count all points on the best line, including duplicates.

Find maximum collinear points

Quick Overview

Input

Output

Constraints

Notes

Comments (0)