Given a grid with R (Rows) and C (Coloumns) and N points (R,C) within the grid. I need to find the count of maximum mutually equidistant collinear points.
I came up with N^3 complexity approach, but it's too slow to work. Is there any better approach?
asked 21 Apr, 09:32