Max Points on a Line gives an array of unique points on the X–Y plane. Return the greatest number of points that lie on one straight line, including vertical lines.
Statement
Given an integer array of points where points[i]=[xi,yi] represents a point on the X–Y plane, your task is to return the maximum number of points on the same straight line.
Constraints:
1≤points.length≤300
points[i].length=2
−104≤xi,yi≤104
All the points are unique.
Examples
1/ 3
Understand the problem
Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:
Max Points on a Line
1.
If the given points are [[1,1],[2,3],[3,5]], how many points lie on the same line?
A.
1
B.
2
C.
3
D.
None
1 / 3
Figure it out!
We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.
Sequence - Vertical
Drag and drop the cards to rearrange them in the correct sequence.
1
2
3
4
5
Try it yourself
Implement your solution in the following coding playground.
Max Points on a Line gives an array of unique points on the X–Y plane. Return the greatest number of points that lie on one straight line, including vertical lines.
Statement
Given an integer array of points where points[i]=[xi,yi] represents a point on the X–Y plane, your task is to return the maximum number of points on the same straight line.
Constraints:
1≤points.length≤300
points[i].length=2
−104≤xi,yi≤104
All the points are unique.
Examples
1/ 3
Understand the problem
Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:
Max Points on a Line
1.
If the given points are [[1,1],[2,3],[3,5]], how many points lie on the same line?
A.
1
B.
2
C.
3
D.
None
1 / 3
Figure it out!
We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.
Sequence - Vertical
Drag and drop the cards to rearrange them in the correct sequence.
1
2
3
4
5
Try it yourself
Implement your solution in the following coding playground.