Maximum Number of Collinear Points

Source: Asked to me by a friend - who was asked this question in an interview at Facebook

Problem:

Given n points on a 2D plane, find the equation of the line with maximum number of collinear points. What is the time complexity of your algorithm?






Comments

  1. piyushmahesh11:47 PM, December 29, 2014

    1) Take any point x and find the slope from x to every other point - O(n)
    2) Find the number of points for each slope by hashing or building a binary search tree - O(nlogn)
    3) Find the max number of point for any slope
    4) Repeat this for every point and find the max among them

    Total time complexity - O(n*n*logn)

    ReplyDelete
  2. Unknown4:18 AM, October 31, 2015

    a line is defined by the equation ax+b = y;

    Initialize a hashmap with key (a,b) and an integer value;

    for each edge of two points :
    compute a,b and increment the integer value associated with (a,b) in the hashmap
    O(n*n)

    compute max of the values in the hashmap and return key associated
    O(n*n)

    Total time complexity O(n*n)

    ReplyDelete
    Replies
    1. Unknown10:09 PM, December 06, 2018

      Your complexity analysis assumes that HashMap could be updated in O(1). So, overall complexity should be expected O(n*n).

      Delete
  3. Unknown4:22 AM, October 31, 2015

    a line is defined by its equation ax+b = y;

    Initialize a hashmap with key (a, b) and integer value

    for each edge of two points, compute a and b,
    increment the value associated with key (a,b)
    O(n*n)

    compute the max of values in the hashmap and return key associated
    O(n*n)

    Total time complexity : O(n*n)

    ReplyDelete
  4. Unknown1:52 AM, December 07, 2015

    Can we use something like this ?

    Sort the points based on x and y coordinates.

    Then basically use DP approach to get the longest increasing sequence with the same slope

    ReplyDelete

Post a Comment

Popular posts from this blog

Fraction Brainteaser

Source: Sent to me by Gaurav Sinha Problem: Siddhant writes a Maths test and correctly answers 5 out of 6 Arithmetic questions and 20 out of 28 Geometry questions.  In total, Siddhant scores 25 out of 34.  Vaibhav writes another Maths test and correctly answers 20 out of 25 Arithmetic questions and 6 out of 9 Geometry questions. in total, Vaibhav scores 26 out of 34. Note that a) Vaibhav scores more than Siddhant b) Siddhant score better than Vaibhav in both individual topics -  5/6 > 20/25 and 20/28 > 6/9 How is it possible? 
Read more

Buying Dimsums

Source: Alok Goyal (Stellaris VP, Ex-Helion VC) puzzle blog Problem: A fast food restaurant sells dimsums in boxes of 7 and 3. What’s the greatest number of dimsums a person cannot buy. Generalize it for p and q where p and q are relatively prime. I loved the puzzle. Hope you enjoy it too.
Read more

Consecutive Heads

Let's say A keep tossing a fair coin, until he get 2 consecutive heads, define X to be the number of tosses for this process; B keep tossing another fair coin, until he get 3 consecutive heads, define Y to be the number of the tosses for this process. 1) Calculate P{X>Y} 2) What's the expected value of X 3) What's the expected value of Y This is probably the hardest puzzle I have ever put on my blog. Hence, I will post its solution in the post directly rather than on comment. Solution: 1) (Solved by me finally after 13 months :)) Make a state diagram. Let the state be (a,b) where a is the number of consecutive heads streak "A" is on currently and b is the number of consecutive heads streak "B" is on currently. So, (0,3) (1,3) are final accepted states and (2,0) (2,1) (2,2) (2,3) are failure states. If you get tails, your contribution to the state reaches to "0" f(State) = P(X>Y | "State" configuration initially)
Read more