Given a two balanced binary search trees.Merge both the trees so that
it will form again a balanced binary search tree.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To
Question: Design a component that implements the following
functionality..
1) Record an Event (For the sake of simplicity, treat the Event as an
integer code)
2) Return the number of Events recorded in the last one minute.
3) Return the number of Events recorded in the last one hour.
i.e implement
@Kunal: dude i am no spammer.
That was just a joke.
@Akshay: MapReduce just distributes your task on the cluster where each node
does its assigned task, and the final result is obtained by mapping all the
individual results. What does it has to do with dbs?
On Fri, Jun 3, 2011 at 7:34 PM, Kunal
Everything that is entered into Facebook is sent to an isolated monastery in
northern Europe where monks work all day and night to memorize incoming
data. When a request for data comes in, it gets sent to the monastary and
the monk responsible for remembering the information recites it to an
How will you design a site similar to tinyurl.com?
Simple hashing may require a lot of space, and collisions is another
issue. Any other approch other than just hashing?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
...@gmail.comwrote:
Why to do hashing?? rather generate a unique id everytime...
On Fri, Jun 3, 2011 at 9:50 PM, Nate nate.archibal...@gmail.com wrote:
How will you design a site similar to tinyurl.com?
Simple hashing may require a lot of space, and collisions is another
issue. Any other approch other than
1. You are given the ‘downloads’ folder on a computer which may
contain a number of files that are duplicates of each other. (these
files are the same byte-wise but may have diff names) describe a
method which identifies all duplicates in the least amount of time.
2. Now there are k
