How did u solved :
3) There is a list containing the checkin and checkout time of every person
in a party . The checkin time is in ascending order while the checkout is
random .
Eg:
Check_inCheck_out
Person 1 8.00 9.00
i think find max and min of all time-stamps respectively
On Mon, Aug 22, 2011 at 12:44 PM, saurabh agrawal saurabh...@gmail.comwrote:
How did u solved :
3) There is a list containing the checkin and checkout time of every person
in a party . The checkin time is in ascending order while the
@saurabh
pls post ur solutions too
On Mon, Aug 22, 2011 at 12:48 PM, Jagannath Prasad Das
jpdasi...@gmail.comwrote:
i think find max and min of all time-stamps respectively
On Mon, Aug 22, 2011 at 12:44 PM, saurabh agrawal saurabh...@gmail.comwrote:
How did u solved :
3) There is a list
for the stick prob is the stick length required?
On Mon, Aug 22, 2011 at 12:48 PM, Jagannath Prasad Das
jpdasi...@gmail.comwrote:
i think find max and min of all time-stamps respectively
On Mon, Aug 22, 2011 at 12:44 PM, saurabh agrawal saurabh...@gmail.comwrote:
How did u solved :
3)
Sticks length not required . Think in coordinate geometry in 3D .
Also for Checkin and Checkout question - Make a flag array associated with
each element of the list and initialize the every element to *{1}* and
traverse the checkout list (checkout[i]) . Now do binary search for an entry
in
Hi,
This is my Adobe interview experience for freshers :
*Written Test:*
Engineering – 45 Minutes - Data Structures, Algorithms,
Operating Systems
C/C++ – 45 Minutes - C/C++ Fundamentals Coding
Aptitude– 45 Minutes –
