Max Points on a Line | Dataford Interview Questions

Find the maximum number of points on a line (it's a problem straight from Leetcode)

Given a list of integer coordinate pairs, return the maximum number of points that lie on one straight line. Implement def max_points(points):, where points is a list of [x, y] pairs and the result is an integer. Account for duplicate points, vertical lines, horizontal lines, and negative slopes.

Constraints

1 <= points.length <= 300
points[i].length == 2
-10^4 <= points[i][0], points[i][1] <= 10^4
Coordinates may be duplicated

Function Signature

def max_points(points):

Your question is Max Points on a Line. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Find the maximum number of points on a line (it's a problem straight from Leetcode)

Constraints

1 <= points.length <= 300
points[i].length == 2
-10^4 <= points[i][0], points[i][1] <= 10^4
Coordinates may be duplicated

Function Signature

def max_points(points):

Your question is Max Points on a Line. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.