1) - When u login, it retrieves all the unread mails only. Which data
structure should you use ?
2)- If you get an event invitation then u have to be notified . eg if u
have two event invitations, one is in the next hour and other one 2 months
later, the one that is tomorrow will be given a higher
stack coz of the lifo nature . i guess so
On Fri, Sep 2, 2011 at 11:08 AM, Mani Bharathi wrote:
> @kb2029: how? why?
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To view this discussion on the web visit
> https://groups.google.co
See When we keep on pouring rice in a bag , then the rice which was poured
last will be the first to be taken out ,
| |
| * |
| * |
| * |
|_*_|
Assume stars represents rice !
|On Fri, Sep 2, 2011 at 11:08 AM, Mani Bharathi wrote:
> @kb2029: how? why?
>
> --
> Yo
@kb2029: how? why?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/UKMOdCLe0sUJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubsc
I think stack !
On Fri, Sep 2, 2011 at 10:11 AM, Mani Bharathi wrote:
> Which data structure is analogous to the rice bag in your kitchen? why?
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To view this discussion on the web visit
Which data structure is analogous to the rice bag in your kitchen? why?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/VnOtIrVKXrYJ.
To post to this group,
Hi,
Convert a min heap to BST without changing its structure and of course no
extra space.
Please post a code snippet also.
--
AMAN AGARWAL
"Success is not final, Failure is not fatal: It is the courage to continue
that counts!"
--
You received this message because you are subscribed to the G
Can you please suggest me your approch. Plaese give a code snippet for your
approach.
On Wed, Aug 3, 2011 at 12:13 PM, Nitin Nizhawan wrote:
> nlogn ?
>
> On Wed, Aug 3, 2011 at 12:10 PM, AMAN AGARWAL wrote:
>
>>
>> Hi,
>> Convert a BST to max heap without using extra memory and in as optimum
>>
nlogn ?
On Wed, Aug 3, 2011 at 12:10 PM, AMAN AGARWAL wrote:
>
> Hi,
> Convert a BST to max heap without using extra memory and in as optimum time
> as possible.
>
>
> --
> AMAN AGARWAL
> "Success is not final, Failure is not fatal: It is the courage to continue
> that counts!"
>
> --
> You rece
Hi,
Convert a BST to max heap without using extra memory and in as optimum time
as possible.
--
AMAN AGARWAL
"Success is not final, Failure is not fatal: It is the courage to continue
that counts!"
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks"
Find the ‘n’th node as it appears in the in order traversal of the given
tree if each node contains the number of nodes in its subtree as value of
node.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visi
11 matches
Mail list logo
