Skip to main content

Google Minimum Distance Pipeline

In a city there are n number of gas stations. A gas pipleline from government has to pass right
through (vertically only) the city. You have to create an algorithm which tells you the best place
the pipe line should pass and cost to government is minimum. Cost is always propotional to the distance
from gas station to pipeline.

Silly me, it took so much time to answer this one.

Okie i am posting my answer....

Sort the points for X axis...take a median of them. That will be the line x=c.

Lets say there are n points.
case 1: n is odd. So there will be a single point for median. say i.
Distance between a point from pipeline is abs(x1-xi).
As there are odd points so except the median, all the points will form a pair.
Between a pair of points if we move the pipeline between them, effective
distance from pipeline will remain constant.
So if median of x-axis value our pipeline is passing then effective distance
will be same till for all the pair of points on its two different sides.

P1 . P2
P1 . P2
P1 . P2

See for the above case total distance will be same pipeline passing between them
As we took median so for all the points that will make it constanst distance and minimum too.

Case 2: if n is even.
SO we can take any point in between the two median points and distance will be still same. Above appiles here again and make it minimum distance.

Comments

Post a Comment

Popular posts from this blog

Car Parking Problem

There is n parking slots and n-1 car already parked. Lets say car parked with initial arrangement and we want to make the car to be parked to some other arrangement. Lets say n = 5, inital = free, 3, 4, 1, 2 desired = 1, free, 2, 4 ,3 Give an algorithm with minimum steps needed to get desired arrangement. Told by one of my friend and after a lot of search i really got a nice solution. I will post solution in comment part
3 comments
Read more

DEShaw Interview Questions

ther are N numbers frm 1 to N and starting from index 1 we will keep deleting every alternate going in cyclic order with array. Only one element will be left at the end. Tell us the index of element in array we started. e.g. there are 5 nums 1 2 3 4 5 then after 1st iteration 1 3 5 will be remained. .. then 1 will be next to be elliminated and then 5 3 will remain alone... give sum efficient algorithm to calculate which numer will remain at the end Answer: 2*(n-2^p)+1 where p=floor(log2 n)
Post a Comment
Read more

One way : Heap or Stack allocation

Took my time to find solution for this and it actually made me realize how much i have to learn. Now question is how can we enforce the creation of objects whether on heap or stack. Creating object on Heap only. Make your destructor private and create a destroy function. Class A {  ~A(){} public:  A(){} void destroy() { delete this; } } Now if you can not create your object: A a; // error: 'A::~A()' is private A  a = new A(); Great. Now all the objects will be allocated to heap only. Making destructor private a better choice than constructor as we don't know number of constructor so early in programming. Creating object on stack While i knew that it has to do something with operator new, but could not figure out how can i create object on stack and return the memory back to class initialization. Though answer was simple, i had to google for that: Overload operator new, new[], operator delete and delete[] and make them private ;) class A { pr...
Post a Comment
Read more