Skip to main content

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
Labels:

Comments

  1. AshuDecember 13, 2009 at 10:17 PM

    Let D={d_1,d_2,..,d_n} be the desired parking arrangement
    and C={c_1,c_2,...c_n} be the current parking arrangement.
    Let M=\sum_{i=1]^{n} (c_i!=d_i)

    1)Let e be the index of the empty slot in the current arrangement(C).
    2)Define a boolean variable X .
    X=1 if the empty slot is matched and 0 otherwise
    ie
    X=1 if ∃ i : c_i=d_i=Empty
    X=0 if ∃! i : c_i=d_i=Empty
    3)If X=0, let k be the index such that c_k=d_e, set M=M-1 if d_k!=free, set M=M-2 if d_k=free
    4)If X=1, let k be the smallest index such that c_k!=d_k and set M=M+1
    5)Put the car currently parked in c_k to c_e
    6)Define C' such that C'[m]=C[m] if m!=k and m!=e.Set C'[k]=C[e] and C'[e]=C[k]
    7)Set C=C'
    8)If M>0 goto step 1, otherwise exit

    Got it from algorithm community ..courtesy Balakrishnan.

    ReplyDelete
  2. AnonymousJuly 9, 2010 at 11:20 PM

    the question is not clear??

    ReplyDelete
  3. AnonymousJuly 9, 2010 at 11:34 PM

    wat does M=\sum_{i=1]^{n} (c_i!=d_i) mean.

    ReplyDelete

Post a Comment

Popular posts from this blog

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

HTTP/2 : what and why

HTTP History In 1989, the hypertext transfer protocol have been invented. HTTP/1.1 has been released in 1997 and took the longest pause in evolution. In 2015, Google has redrafted its inhouse SPDY protocol to HTTP/2 to optimize the web page load time.  HTTP/1.1 Pitfalls Too heavy and big protocol. Too many parts have been added as optional led to complicating the protocols with less of usage. Since HTTP1.1 release, web technology have seen tremendous change. Page size has been increased to MBs, the number to pages increased manifolds and parallel components making HTTP calls increased too.  Each HTTP request has a separate TCP connection and its handshake does add to page load time.  Head of line blocking has slowed the page load. We can have a maximum 8 parallel connection to the same domain. Due to increase in multiple components making separate HTTP calls, this has been a bottleneck.  HTTP/2 Solution Binary framing layer: HTTP/1.1 was text-only messaging, which wa...
Post a Comment
Read more