×

# Maximum mutually equidistant collinear points.

 0 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. Mutually equidistant points here means, Every point on that line should be at equal distance with its neighbouring point on that line only (1,1 -> 3,3 -> 5,5 -> 7,7). A line would be discarded if it contains non-mutually equidistant points(or point). (1-1 -> 3,3 ->5,5 ->6,6 is an invalid line). I came up with N^3 complexity approach, but it's too slow to work. Is there any better approach? Thank you. asked 21 Apr '17, 09:32 48●6 accept rate: 20%
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×1,046
×572
×28
×1

question asked: 21 Apr '17, 09:32

question was seen: 284 times

last updated: 21 Apr '17, 09:32