Hi,
Can someone recommend me good resources (books/websites etc.) for
design interview questions.
Thanks
--
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 unsubscribe from thi
A pile of nuts is in an oasis, across a desert from a town. The pile
contains 'N' kg of nuts, and the town is 'D' kilometers away from the
pile.
The goal of this problem is to write a program that will compute 'X',
the maximum amount of nuts that can be transported to the town.
The nuts are transpo
assuming its a binary tree
Node* mirror(Node* root){
if(root==NULL)
return;
Node* mirrorLeft = mirror(root->left)'
Node* mirrorRight = mirror(root->right);
root->left = mirrorRight;
root->right=mirrorLeft;
return root;
}
On Mar 11, 4:50 am, AKS wrote:
> can u
suppose the original length was 'x' cm and original width was 'y' cm.
After 3 wishes, the final length will be x/8 cm and width will be
reduced to x/27 cm
y=9 cm (given)
(x/8) * (y/27) = 4, solve for x whch will be 96cm
On Mar 9, 12:06 am, Lavesh Rawat wrote:
> *Magic Belt Problem Solution*
> *
1. sort the pairs with key as one of the parameters
2. find the longest increasing sub-sequence (not necessarily
contiguous) from the sorted list with key the the other parameter.
Sachin
On Mar 1, 3:02 pm, bittu wrote:
> A circus is designing a tower routine consisting of people standing
> atop
event n
>
> On Wed, Feb 9, 2011 at 11:30 AM, Sachin Agarwal
> wrote:
>
>
>
>
>
>
>
> > Suppose I have a room and I want to schedule meetings in it. You're
> > given a list of meeting start and end times. Find a way to schedule
> > the maximum number
Suppose I have a room and I want to schedule meetings in it. You're
given a list of meeting start and end times. Find a way to schedule
the maximum number of meetings in the room.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to thi
