Smallest Snip of givem M words

Yor are given occurrences of 3 words (say, "bangalore", "hyderabad", "google") in a file.
bangalore: 100, 130, 157, ...
hyderabad: 80, 145, 180, ....
google: 60, 139, 197, ...
[Note: occurrences are given in sorted order.]
Now, you need to find the "smallest snip" containing all these three words.
[In this case: 130("hyderabad"), 139("google"), 145("bangalore") - 15 is snippet size].

Can you generalize this for m words and length of occurrences is n.

Algorithm:
Take first element from all list and put in a array.
minsnip = INT_MAX;
while any of list have element.
do
currentsnip = max in array - min in array;
if currentsnip < minsnip
minsnip = currentsnip;
delete the min element from array.
Get second element fron deleted list.
done

Comments

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

Median of Five Numbers

U have 5 NOs , X1,X2,X3,X4,X5 With minimum no. of comparisons we have to find a median. SWAP(X,Y) function is available to u . I have a answer of six comparisons and eight swaps....wait for people to find out by themselves.

Consistent Hashing

I will try to explain consistent hashing with a real world example. Let's assume I have a restaurant with 60 tables and 5 servers (waiter). Each server is given an equal number of tables to serve. Now let's assume we have addition of a new server (waiter), so his addition will be marked in the circle and he will be receiving tables from the previous server to his distance only. Check the attached example. Assume a server (waiter) has left the organisation and we have only 4 servers now. Server3 has left the restaurant, so his table will be assigned to server 4. I am sure you have noticed the load is not equally distributed. But to make the system less prone to addition/removal we just rotate in clockwise and assign range from the previous server to present server. To make sure load is balanced or optimally balanced we need to use virtual nodes. Check links here: http://tom-e-white.com/2007/11/consistent-hashing.html https://www.toptal.com/big-data/...

GeeksSpot

Search This Blog