Maximum Drop Points in One Line

Requirements

• The function receives xCoords and yCoords, both lists of integers with equal length. Each index i pairs xCoords[i] and yCoords[i] as one two-dimensional drop point.
• The flight path must be either horizontal or vertical. Diagonal paths and paths that combine horizontal and vertical movement are invalid.
• A path must pass through more than one drop point; one point alone does not constitute a valid path.
• The constraint is 1 < N, M <= 700, where N = len(xCoords) and M = len(yCoords).
• Return the greatest number of drop points covered by a single valid path.

Examples

Example 1

max_points_on_line([2, 3, 2, 4, 2], [2, 2, 6, 5, 8]) -> 3

xCoords = [2,3,2,4,2]
yCoords = [2,2,6,5,8]

3

The vertical line at x = 2 passes through three drop points, which is more than any other valid horizontal or vertical path.

Example 2

max_points_on_line([1, 2, 3], [4, 4, 5]) -> 2

The two points whose y-coordinate is 4 lie on the same horizontal path, so two drop points can be covered.

Notes

• Cases in which every x-coordinate and every y-coordinate is unique must be handled carefully, because a single point does not form a valid path.