Skip to content
LeetCode Solutions

Max Points on a Line

Problem Statement

Section titled “Problem Statement”

Given an array of points where points[i] = [xi, yi], return the maximum number of points that lie on the same straight line.

You need to solve this problem efficiently.

Examples

Section titled “Examples”
InputOutputExplanation
Example 1Result 1Explanation for example 1
Example 2Result 2Explanation for example 2

Constraints

Section titled “Constraints”
  • Constraint 1 for Max Points on a Line
  • Constraint 2
  • Constraint 3

Real-World Applications

Section titled “Real-World Applications”

Complexity Comparison

Section titled “Complexity Comparison”
ApproachTimeSpaceBest When
Slope CountingO(n)O(1)When applicable
GcdO(n)O(1)When applicable
Brute ForceO(n)O(1)When applicable

Approach 1: Slope Counting

Section titled “Approach 1: Slope Counting”
★ Recommended

This approach provides an efficient solution for max points on a line.

⏱ Time O(n) Single pass 💾 Space O(1) Minimal storage

Solution Code

Section titled “Solution Code”
max_points_on_a_line_slope_counting.py
# Python Solution
# Problem: max-points-on-a-line
# Approach: slope_counting


# Implementation placeholder for max_points_on_a_line_slope_counting
# This file is auto-generated and should contain the solution code.


def max_points_on_a_line_slope_counting():
    pass


if __name__ == "__main__":
    pass

Approach 2: Gcd

Section titled “Approach 2: Gcd”
🎯 Interview Favourite

This approach provides an efficient solution for max points on a line.

⏱ Time O(n) Single pass 💾 Space O(1) Minimal storage

Solution Code

Section titled “Solution Code”
max_points_on_a_line_gcd.py
# Python Solution
# Problem: max-points-on-a-line
# Approach: gcd


# Implementation placeholder for max_points_on_a_line_gcd
# This file is auto-generated and should contain the solution code.


def max_points_on_a_line_gcd():
    pass


if __name__ == "__main__":
    pass

Approach 3: Brute Force

Section titled “Approach 3: Brute Force”
✓ Simple

This approach provides an efficient solution for max points on a line.

⏱ Time O(n) Single pass 💾 Space O(1) Minimal storage

Solution Code

Section titled “Solution Code”
max_points_on_a_line_brute_force.py
# Python Solution
# Problem: max-points-on-a-line
# Approach: brute_force


# Implementation placeholder for max_points_on_a_line_brute_force
# This file is auto-generated and should contain the solution code.


def max_points_on_a_line_brute_force():
    pass


if __name__ == "__main__":
    pass

Related Problems

Interview Tips

Section titled “Interview Tips”