I haven't done research on whether the question and input really is the same in both cases, but I find that the Leetcode answer is the correct one when considering both the test case and the question from Leetcode.

To solve this problem one must find the maximum number of points that lie on a distinct linear function y=kx+b or a vertical line x=?. Of course, there's no need to find all the lines that a points lies on. If the answer to the problem is larger than 1, we can process the points pairwise and find a common linear functions or vertical lines.

Note that we should store both k and b as fractions, i.e. pair of numerator and denominator, to avoid precision problems. These fractions must be reduced as much as possible... to do so divide both the numerator and denominator by the GCD and if the fraction is negative keep the sign on the numerator.

To count how many points lie on a distinct linear function we can keep a map<pair<ii, ii>, set<ll>>, where ll denotes long long and ii denotes pair<ll,ll>. The key of the map would store a pair of k and b and the value of the map would store a set of indices for points that lie on y=kx+b.