[algogeeks]

[balaji a]

Tujdqgtvg gR

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] [brain teaser ] Secret Code puzzle 9 june

[balaji a]

7
4
6
5
8

On 9 Jun 2011 13:37, "Lavesh Rawat"  wrote:

*Secret Code puzzle
*
*
*
**
*A man wanted to get into his work building, but he had forgotten his code.
However, he did remember five clues. These are what those clues were:

The fifth number plus the third number equals fourteen.

The fourth number is one more than the second number.

The first number is one less than twice the second number.

The second number plus the third number equals ten.

The sum of all five numbers is 30.

What were the five numbers and in what order?
*

*Update Your Answers at* : Click
Here


Solution:

Will be updated after 1 day


-- 

"Never explain yourself. Your friends don’t need it and
your enemies won’t believe it" .

-- 
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 this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] [brain teaser ] Life Or Death 3 june

[balaji a]

But when we choose the bowl, can't we touch the marbles so that if only one
marble is there in a bowl then we can easily identify by touching it...

On 3 Jun 2011 14:45, "bhavana"  wrote:

According to my solutionprobablity of choosing any bowl is 1/2

So,

if bowl with only 1 white marble is chosen...we wll definitely get white so
P=1
if other bowl chosen..it consists of 49 white & 50 black marbles...so
probablity of drawing a white ball is approx 1/2.

Hence the total probablity of drawing a white ball is

P(W) = (1/2)(1) + (1/2)*(1/2)
= 3/4

On Fri, Jun 3, 2011 at 2:38 PM, D!leep Gupta 
wrote:

>
>
> all white marble in one bowl... all black in other bowl..
>
> On Fri, Jun 3, 2011 at 1:51 PM, ...

-- 
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" grou...

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] [brain teaser ] assemble riddle 2 april

[balaji a]

Lion

On 2 Jun 2011 12:42, "Lavesh Rawat"  wrote:

*assemble riddle
 *
*
*
**
*What king can you make if you take
the head of a lamb
the middle of a pig
the hind of a buffalo
and the tail of a dragon ?
*
*
*
*Update Your Answers at* : Click
Here


Solution:

Will be updated after 1 day




-- 

"Never explain yourself. Your friends don’t need it and
your enemies won’t believe it" .

-- 
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 this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Amazon online test

[balaji a]

I actually attended on-campus through my college...

On 26 May 2011 16:24, "jagannath prasad das"  wrote:

how to register for amazon ol exm .can  you plz mention ?

On Sun, Apr 24, 2011 at 6:46 PM, balaji a  wrote:

> >
> > yeah i did.,...there were two section
> > Section 1 - some aptitude question + predicting output ...
>
> --
>
> > You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group
>


-- 
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" gr...

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Amazon online test

[balaji a]

yeah i did.,...there were two section
Section 1 - some aptitude question + predicting output of a given program +
some conceptual question(mainly in OS)
Section 2- programming section...there were three questions
   1)given two sorted linked list u have to return the linked list which
is the merged list of the first two and also is sorted.
2)given two Binary trees, u have to find whether the second is a sub
tree of the first...
3)Given an array which contains integers(may contain thousands of
elements), u have to write a program to find the second largest element of
the group
   the first two u can run (i.e) u can check the outputbut
the third u have to just write the code and u cant check the output

On Sun, Apr 24, 2011 at 6:15 PM, JeanGrey  wrote:

> Has anyone attended amazon online test recently  ? what will be the
> type of questions which will be asked?
>
> --
> 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 this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>


-- 
A.Balaji

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] [brain teaser ] 8april

[balaji a]

Both say lies and A is monkey and B is a human...

On Friday, April 8, 2011, Lavesh Rawat  wrote:
> Island Puzzle
>
>
> There are people and strange monkeys on this island, and you can not tell who 
> is who. They speak either only the truth or only lies.
> Who are the following two guys?
> A: B is a lying monkey. I am human.
> B: A is telling the truth.
>
> Update Your Answers at : Click 
> Here 
>
>
> Solution:Will be updated after 1 day
>
>
> --
>
>                     "Never explain yourself. Your friends don’t need it and 
> your enemies won’t believe it" .
>
>
>
> --
> 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 this group, send email to 
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at 
> http://groups.google.com/group/algogeeks?hl=en.
>

-- 
A.Balaji

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] [brain teaser ] 8april

[balaji a]

Both say liesA is monkey and B is a human...

On Friday, April 8, 2011, Lavesh Rawat  wrote:
> Island Puzzle
>
>
> There are people and strange monkeys on this island, and you can not tell
who is who. They speak either only the truth or only lies.
> Who are the following two guys?
> A: B is a lying monkey. I am human.
> B: A is telling the truth.
>
> Update Your Answers at : Click Here <
http://dailybrainteaser.blogspot.com/2011/04/8april.html?lavesh=lavesh>
>
>
> Solution:Will be updated after 1 day
>
>
> --
>
> "Never explain yourself. Your friends don’t need it
and your enemies won’t believe it" .
>
>
>
> --
> 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 this group, send email to
algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
>

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Interview Question

[balaji a]

lets say there are two pointers - temp1,temp2 and the start of the node is
head
now,
  temp1=head;
  temp2=head->next;

 temp1->next=temp2->next;

 now temp1 points to the first node and the temp2 points to the second
node(which got deleted from the list).

On Thu, Apr 7, 2011 at 5:43 PM, Umer Farooq  wrote:

> That can be moved. Basically, he is trying to convey that move the data of
> temp->next to temp. That's perfectly fine.
>
>
> On Thu, Apr 7, 2011 at 2:05 PM, Akash Mukherjee wrote:
>
>> @ anurag
>>
>> temp -> data = ( temp -> next ) -> data ;
>>
>> but data cannot be moved, ryt??
>>
>> On 4/6/11, Anurag atri  wrote:
>> > in case you are given a pointer to the first node simply do
>> > temp ->next = ( temp -> next ) -> next .
>> > if you are given a pointer to the second node do ,
>> > temp -> data = ( temp -> next ) -> data ;
>> > temp -> next = NULL ;
>> >
>> > correct me if I am wrong .
>> >
>> > On Mon, Apr 4, 2011 at 9:48 PM, Umer Farooq 
>> wrote:
>> >
>> >> Hello friends,
>> >>
>> >> The following question has appeared in two top companies of my city.
>> I'd
>> >> appreciate if anyone is able to answer it.
>> >>
>> >> Given a singly liked list comprising of three nodes
>> >>
>> >> Delete the middle node such that:
>> >>
>> >> 1- A temp pointer is pointing to the first node
>> >> 2- A temp pointer is pointing to the second node.
>> >>
>> >> You can not use any other pointer and you can not move data.
>> >>
>> >> --
>> >> Umer
>> >>
>> >> --
>> >> 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 this group, send email to
>> >> algogeeks+unsubscr...@googlegroups.com.
>> >> For more options, visit this group at
>> >> http://groups.google.com/group/algogeeks?hl=en.
>> >>
>> >
>> >
>> >
>> > --
>> > Regards
>> > Anurag Atri
>> >
>> > --
>> > 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 this group, send email to
>> > algogeeks+unsubscr...@googlegroups.com.
>> > For more options, visit this group at
>> > http://groups.google.com/group/algogeeks?hl=en.
>> >
>> >
>>
>> --
>> 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 this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>>
>
>
> --
> Umer
>
> --
> 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 this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
A.Balaji

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] [brain teaser ] 6april

[balaji a]

when u throw it above u.

On Wed, Apr 6, 2011 at 1:16 PM, Lavesh Rawat  wrote:

> * The Ball Puzzle
>
> *How can you throw a ball as hard as you can and have it come back to you,
> even if it doesn't bounce off anything? There is nothing attached to it, and
> no one else catches or throws it back to you.
>
> Update Your Answers at : Click 
> Here
>
> Solution:
> Will be updated after 1 day
>
> --
>
> "Never explain yourself. Your friends don’t need it and
> your enemies won’t believe it" .
>
> --
> 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 this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
A.Balaji

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] [brain teaser ] 5april

[balaji a]

only 14 can be the answerits sure that there cant be another
answer...the problem can be easily done by backtracking approach...

At the end of the third person he had 0 roses
   This is after including one complementary rose.
   So before giving the complementary rose he had 1 rose. This one rose
is after the third person bought of the the roses.
   So double of the present roses gives 2..

So at the end of the second person there were 2 roses.
   Again repeating the above steps we can get 6.

So at the end of first person there were 6 roses.
 Again repeating the same procedure we get 14.

On Tue, Apr 5, 2011 at 1:53 PM, DeboJeet Choudhury <
wildrahul.on...@gmail.com> wrote:

> am sure dre is jst 1 ans nd dat is 14...
>
>
> On Tue, Apr 5, 2011 at 1:52 PM, hary rathor wrote:
>
>> there are many ans exit for this problem ..
>> 2 of them exist above...
>>
>>  --
>> 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 this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>
>
> --
> *Wishing you success in your  endeavors *
>
>  --
> 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 this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
A.Balaji

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Output of the code

[balaji a]

the code will give error as there is nothing called "true" defined.

On Sun, Mar 27, 2011 at 10:38 PM, Umer Farooq  wrote:

> Hi,
>
> Can anyone tell me the output of the following code?
>
> #include 
>
> int main()
> {
> .. if (true)
> .. cout << "Pakistan will win the WorldCup 2011\n";
> return 0;
> }
>
> --
> Umer
>
> --
> 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 this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
A.Balaji

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: debugging contest

[balaji a]

None of the statements except those inside the 'case' executesaccording
to the input, the default case gets executed which is the inner switch which
prints nine..

On Wed, Mar 23, 2011 at 8:46 PM, cegprakash  wrote:

> i=9;
>switch(i){
>  xxx: printf("default");
>  yyy:printf("hello");
>  asdfasdf: printf("why no errors and why not printed");
>  case '1': printf("one");
>
>  default:
>  switch(i){
>
>   case '1': printf("one"); break;
>   case '2': printf("two"); break;
>   case 9: printf("nine"); break;
>  }
>   break;
> }
>
> the output is "nine"
>
> why no errors for the above code?
> now someone tell what are the dummy labels xxx yyy and why they are
> not executed?
>
> --
> 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 this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>


-- 
A.Balaji

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Coding Round

[balaji a]

anyone who has a good solution to any of the questions which i had listed,
plz discuss here...

On Sat, Mar 26, 2011 at 5:22 PM, balaji a  wrote:

> yeah the solution looks good :-)
>
>
> On Sat, Mar 26, 2011 at 4:06 PM, kunal srivastav <
> kunal.shrivas...@gmail.com> wrote:
>
>> maintain a pointer to the max element so far in every element of the
>> stack..
>> while push - if the new element is greater than the stack->top->max then
>> add the new element at the top and hence make the max pointer of the new
>> element point to itself, otherwise the new element is less than the max till
>> yet and hence point the max part of the new element to the max part of the
>> element at the top
>>
>> thus at each point the max pointer of the top most element points to the
>> current max of the stack
>>
>> pop - usual, no need to do anything :)
>>
>> see if you are able to follow this logic. getmax() is O(1) because you
>> just need to deference the max part of the top most element at any time
>>
>> On Sat, Mar 26, 2011 at 3:43 PM, balaji a wrote:
>>
>>> yeah it wont remove the element...GetMax() only returns the maximum
>>> element added so far..
>>>
>>>
>>> On Thu, Mar 24, 2011 at 9:42 AM, MK  wrote:
>>>
>>>> Actually, you probably mean that GetMax() does not remove it from the
>>>> DS?
>>>>
>>>> Sorry for the hasty conclusion.
>>>>
>>>> On Thu, Mar 24, 2011 at 12:11 AM, MK  wrote:
>>>> > "2) Design a DS that would do Push(),Pop(), and GetMax() elements at
>>>> > complexity O(1)"
>>>> >
>>>> > Are you sure you remember this correctly? This would give you a way of
>>>> > sorting in O(1).
>>>> >
>>>> > Thanks..
>>>> >
>>>> >
>>>> >
>>>> > On Thu, Mar 24, 2011 at 12:09 AM, balaji a 
>>>> wrote:
>>>> >> The main thing they are testing is Problem Solving and the Algorithm
>>>> >> Designing ability. Coding Ability is only next. If you have good
>>>> knowledge
>>>> >> in Data Structures and good Problem Solving skills with coding
>>>> ability you
>>>> >> can easily crack through the interview. This is what i infered from
>>>> my
>>>> >> experience.
>>>> >>
>>>> >> On Thu, Mar 24, 2011 at 12:33 AM, kunal srivastav
>>>> >>  wrote:
>>>> >>>
>>>> >>> hi people, could someone tell me in detail what all things to
>>>> prepare for
>>>> >>> amazon including the resources to consult for the same?? it would be
>>>> really
>>>> >>> helpful
>>>> >>>
>>>> >>> On Thu, Mar 24, 2011 at 12:11 AM, Akash Mukherjee <
>>>> akash...@gmail.com>
>>>> >>> wrote:
>>>> >>>>
>>>> >>>> kul man...wud appreciate if u cud post your question
>>>> >>>>
>>>> >>>> On Wed, Mar 23, 2011 at 11:28 PM, balaji a <
>>>> peshwa.bal...@gmail.com>
>>>> >>>> wrote:
>>>> >>>>>
>>>> >>>>> hi i got till the third round of technical interview out of the
>>>> four
>>>> >>>>> rounds and got eliminated in third round.anyways thnx for ur
>>>> support
>>>> >>>>> dude :-)
>>>> >>>>>
>>>> >>>>> On Tue, Mar 22, 2011 at 12:51 PM, balaji a <
>>>> peshwa.bal...@gmail.com>
>>>> >>>>> wrote:
>>>> >>>>>>
>>>> >>>>>> Thnx :-) I am from SSN College of Engineering,Chennai
>>>> >>>>>> l
>>>> >>>
>>>> >>>
>>>> >>>>>>
>>>> >>>>>> On Tue, Mar 22, 2011 at 12:28 PM, Akash Mukherjee <
>>>> akash...@gmail.com>
>>>> >>>>>> wrote:
>>>> >>>>>>>
>>>> >>>>>>> u r welcome :), nd all the best for ur test.btw, which clg??
>>>> >>>>>>>
>>>> >>>>>>> On Tue, Mar 22, 2011 at 11:45 AM, guru >>> >
>>>> >>>>>>> w

Re: [algogeeks] Re: Coding Round

[balaji a]

yeah the solution looks good :-)

On Sat, Mar 26, 2011 at 4:06 PM, kunal srivastav  wrote:

> maintain a pointer to the max element so far in every element of the
> stack..
> while push - if the new element is greater than the stack->top->max then
> add the new element at the top and hence make the max pointer of the new
> element point to itself, otherwise the new element is less than the max till
> yet and hence point the max part of the new element to the max part of the
> element at the top
>
> thus at each point the max pointer of the top most element points to the
> current max of the stack
>
> pop - usual, no need to do anything :)
>
> see if you are able to follow this logic. getmax() is O(1) because you just
> need to deference the max part of the top most element at any time
>
> On Sat, Mar 26, 2011 at 3:43 PM, balaji a  wrote:
>
>> yeah it wont remove the element...GetMax() only returns the maximum
>> element added so far..
>>
>>
>> On Thu, Mar 24, 2011 at 9:42 AM, MK  wrote:
>>
>>> Actually, you probably mean that GetMax() does not remove it from the DS?
>>>
>>> Sorry for the hasty conclusion.
>>>
>>> On Thu, Mar 24, 2011 at 12:11 AM, MK  wrote:
>>> > "2) Design a DS that would do Push(),Pop(), and GetMax() elements at
>>> > complexity O(1)"
>>> >
>>> > Are you sure you remember this correctly? This would give you a way of
>>> > sorting in O(1).
>>> >
>>> > Thanks..
>>> >
>>> >
>>> >
>>> > On Thu, Mar 24, 2011 at 12:09 AM, balaji a 
>>> wrote:
>>> >> The main thing they are testing is Problem Solving and the Algorithm
>>> >> Designing ability. Coding Ability is only next. If you have good
>>> knowledge
>>> >> in Data Structures and good Problem Solving skills with coding ability
>>> you
>>> >> can easily crack through the interview. This is what i infered from my
>>> >> experience.
>>> >>
>>> >> On Thu, Mar 24, 2011 at 12:33 AM, kunal srivastav
>>> >>  wrote:
>>> >>>
>>> >>> hi people, could someone tell me in detail what all things to prepare
>>> for
>>> >>> amazon including the resources to consult for the same?? it would be
>>> really
>>> >>> helpful
>>> >>>
>>> >>> On Thu, Mar 24, 2011 at 12:11 AM, Akash Mukherjee <
>>> akash...@gmail.com>
>>> >>> wrote:
>>> >>>>
>>> >>>> kul man...wud appreciate if u cud post your question
>>> >>>>
>>> >>>> On Wed, Mar 23, 2011 at 11:28 PM, balaji a >> >
>>> >>>> wrote:
>>> >>>>>
>>> >>>>> hi i got till the third round of technical interview out of the
>>> four
>>> >>>>> rounds and got eliminated in third round.anyways thnx for ur
>>> support
>>> >>>>> dude :-)
>>> >>>>>
>>> >>>>> On Tue, Mar 22, 2011 at 12:51 PM, balaji a <
>>> peshwa.bal...@gmail.com>
>>> >>>>> wrote:
>>> >>>>>>
>>> >>>>>> Thnx :-) I am from SSN College of Engineering,Chennai
>>> >>>>>> l
>>> >>>
>>> >>>
>>> >>>>>>
>>> >>>>>> On Tue, Mar 22, 2011 at 12:28 PM, Akash Mukherjee <
>>> akash...@gmail.com>
>>> >>>>>> wrote:
>>> >>>>>>>
>>> >>>>>>> u r welcome :), nd all the best for ur test.btw, which clg??
>>> >>>>>>>
>>> >>>>>>> On Tue, Mar 22, 2011 at 11:45 AM, guru 
>>> >>>>>>> wrote:
>>> >>>>>>>>
>>> >>>>>>>> Thank you very much for the info friendAnd sure will give u
>>> a
>>> >>>>>>>> treat :-)
>>> >>>>>>>>
>>> >>>>>>>> On Mar 22, 11:02 am, Akash Mukherjee 
>>> wrote:
>>> >>>>>>>> > hey, dis is what i was told by a friend working @ amazon -
>>> >>>>>>>> >
>>> >>>>>>>> > Sometimes they do go to the level of the subject basics

Re: [algogeeks] Re: Coding Round

[balaji a]

yeah it wont remove the element...GetMax() only returns the maximum element
added so far..

On Thu, Mar 24, 2011 at 9:42 AM, MK  wrote:

> Actually, you probably mean that GetMax() does not remove it from the DS?
>
> Sorry for the hasty conclusion.
>
> On Thu, Mar 24, 2011 at 12:11 AM, MK  wrote:
> > "2) Design a DS that would do Push(),Pop(), and GetMax() elements at
> > complexity O(1)"
> >
> > Are you sure you remember this correctly? This would give you a way of
> > sorting in O(1).
> >
> > Thanks..
> >
> >
> >
> > On Thu, Mar 24, 2011 at 12:09 AM, balaji a 
> wrote:
> >> The main thing they are testing is Problem Solving and the Algorithm
> >> Designing ability. Coding Ability is only next. If you have good
> knowledge
> >> in Data Structures and good Problem Solving skills with coding ability
> you
> >> can easily crack through the interview. This is what i infered from my
> >> experience.
> >>
> >> On Thu, Mar 24, 2011 at 12:33 AM, kunal srivastav
> >>  wrote:
> >>>
> >>> hi people, could someone tell me in detail what all things to prepare
> for
> >>> amazon including the resources to consult for the same?? it would be
> really
> >>> helpful
> >>>
> >>> On Thu, Mar 24, 2011 at 12:11 AM, Akash Mukherjee 
> >>> wrote:
> >>>>
> >>>> kul man...wud appreciate if u cud post your question
> >>>>
> >>>> On Wed, Mar 23, 2011 at 11:28 PM, balaji a 
> >>>> wrote:
> >>>>>
> >>>>> hi i got till the third round of technical interview out of the four
> >>>>> rounds and got eliminated in third round.anyways thnx for ur
> support
> >>>>> dude :-)
> >>>>>
> >>>>> On Tue, Mar 22, 2011 at 12:51 PM, balaji a 
> >>>>> wrote:
> >>>>>>
> >>>>>> Thnx :-) I am from SSN College of Engineering,Chennai
> >>>>>> l
> >>>
> >>>
> >>>>>>
> >>>>>> On Tue, Mar 22, 2011 at 12:28 PM, Akash Mukherjee <
> akash...@gmail.com>
> >>>>>> wrote:
> >>>>>>>
> >>>>>>> u r welcome :), nd all the best for ur test.btw, which clg??
> >>>>>>>
> >>>>>>> On Tue, Mar 22, 2011 at 11:45 AM, guru 
> >>>>>>> wrote:
> >>>>>>>>
> >>>>>>>> Thank you very much for the info friendAnd sure will give u a
> >>>>>>>> treat :-)
> >>>>>>>>
> >>>>>>>> On Mar 22, 11:02 am, Akash Mukherjee  wrote:
> >>>>>>>> > hey, dis is what i was told by a friend working @ amazon -
> >>>>>>>> >
> >>>>>>>> > Sometimes they do go to the level of the subject basics like OS
> or
> >>>>>>>> > DS but
> >>>>>>>> > you should be able to tackle these if you had studied well. No
> >>>>>>>> > separate prep
> >>>>>>>> > is needed.
> >>>>>>>> >
> >>>>>>>> > Few Favs DS & Algos ( i should get treat for revealing
> this.;)... )
> >>>>>>>> > 1) All Trees (Binary for sure)
> >>>>>>>> > 2) Graphs
> >>>>>>>> > 3) Sorting Algos
> >>>>>>>> > 4) Heaps
> >>>>>>>> > "Let us C" ... though clichéd gives a good insight. If you can
> find
> >>>>>>>> > time.
> >>>>>>>> >
> >>>>>>>> > can u tell a bit more about your profile?? fresher??
> >>>>>>>> >
> >>>>>>>> > On Tue, Mar 22, 2011 at 11:20 AM, guru  >
> >>>>>>>> > wrote:
> >>>>>>>> > > Hi geeks,
> >>>>>>>> > >tomorrow i am having Amazon.com's Coding round followed by
> >>>>>>>> > > Interview...pls suggest some tips to help me out...
> >>>>>>>> >
> >>>>>>>> > > --
> >>>>>>>> > > You received this message because you are subscribed to the
> >>>>>&

Re: [algogeeks] predominant colour

[balaji a]

since all segments connected by each consequetive pair is coloured by red
the total segment will appear redthis is wht i thought.

On Thu, Mar 24, 2011 at 11:08 PM, snehal jain  wrote:

> please explain
>
> On Thu, Mar 24, 2011 at 10:55 PM, balaji a wrote:
>
>> i think its red
>>
>>
>> On Thu, Mar 24, 2011 at 10:44 PM, snehal jain wrote:
>>
>>> You are given a blue segment S of length n. There are n points p_i (0
>>> <= i < n) distributed uniformly at random. You mark in red all the
>>> segments connecting points p_i and p_j what would be the predominant
>>> colour in S after that?
>>>
>>> --
>>> 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 this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com.
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>>
>>
>>
>> --
>> A.Balaji
>>
>>
>>  --
>> 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 this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>  --
> 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 this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
A.Balaji

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] predominant colour

[balaji a]

i think its red

On Thu, Mar 24, 2011 at 10:44 PM, snehal jain  wrote:

> You are given a blue segment S of length n. There are n points p_i (0
> <= i < n) distributed uniformly at random. You mark in red all the
> segments connecting points p_i and p_j what would be the predominant
> colour in S after that?
>
> --
> 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 this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>


-- 
A.Balaji

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] [brain teaser ] 24march

[balaji a]

One person transfers the gold from bag1(which contains gold) to
bag2(initially empty) using one of his hands...He will have a count of how
many times the he used his hand to transfer the goldi.e now he knows the
unit of the gold by the count of his hand and lets say it Nthen he
transfers the gold from bag2 to bag1 for N/2 counts i.e half of the
goldthe second person will be there for inchargethen each takes a
bag.

On Thu, Mar 24, 2011 at 12:01 PM, Lavesh Rawat wrote:

> *Desert Gold Problem Solution*
> Two men found a whole bag of sand gold (its not solid) treasure in the
> desert. Time came when they had to split thier ways and devide this whole
> bag. However, they dont have any kind of measuring equipment/tool. Nothing.
> Just 2 bags. (of course, one is full with sand gold)
> How can they split it fairly so both parties agree on it and are happy
> about the split.
>
> Update Your Answers at : Click 
> Here
>
> Solution:
> Will be updated after 1 day
>
>
> Soln
>
>
> --
> Posted By lavesh to brain teaser 
> solutionsat
>  3/20/2011 11:01:00 PM
>
>
>
> --
>
> "Never explain yourself. Your friends don’t need it and
> your enemies won’t believe it" .
>
> --
> 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 this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
A.Balaji

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Coding Round

[balaji a]

The main thing they are testing is Problem Solving and the Algorithm
Designing ability. Coding Ability is only next. If you have good knowledge
in Data Structures and good Problem Solving skills with coding ability you
can easily crack through the interview. This is what i infered from my
experience.

On Thu, Mar 24, 2011 at 12:33 AM, kunal srivastav <
kunal.shrivas...@gmail.com> wrote:

> hi people, could someone tell me in detail what all things to prepare for
> amazon including the resources to consult for the same?? it would be really
> helpful
>
>
> On Thu, Mar 24, 2011 at 12:11 AM, Akash Mukherjee wrote:
>
>> kul man...wud appreciate if u cud post your question
>>
>>
>> On Wed, Mar 23, 2011 at 11:28 PM, balaji a wrote:
>>
>>> hi i got till the third round of technical interview out of the four
>>> rounds and got eliminated in third round.anyways thnx for ur support
>>> dude :-)
>>>
>>>
>>> On Tue, Mar 22, 2011 at 12:51 PM, balaji a wrote:
>>>
>>>> Thnx :-) I am from SSN College of Engineering,Chennai
>>>> l
>>>>
>>>
>
>>
>>>> On Tue, Mar 22, 2011 at 12:28 PM, Akash Mukherjee 
>>>> wrote:
>>>>
>>>>> u r welcome :), nd all the best for ur test.btw, which clg??
>>>>>
>>>>>
>>>>> On Tue, Mar 22, 2011 at 11:45 AM, guru wrote:
>>>>>
>>>>>> Thank you very much for the info friendAnd sure will give u a
>>>>>> treat :-)
>>>>>>
>>>>>> On Mar 22, 11:02 am, Akash Mukherjee  wrote:
>>>>>> > hey, dis is what i was told by a friend working @ amazon -
>>>>>> >
>>>>>> > Sometimes they do go to the level of the subject basics like OS or
>>>>>> DS but
>>>>>> > you should be able to tackle these if you had studied well. No
>>>>>> separate prep
>>>>>> > is needed.
>>>>>> >
>>>>>> > Few Favs DS & Algos ( i should get treat for revealing this.;)... )
>>>>>> > 1) All Trees (Binary for sure)
>>>>>> > 2) Graphs
>>>>>> > 3) Sorting Algos
>>>>>> > 4) Heaps
>>>>>> > "Let us C" ... though clichéd gives a good insight. If you can find
>>>>>> time.
>>>>>> >
>>>>>> > can u tell a bit more about your profile?? fresher??
>>>>>> >
>>>>>> > On Tue, Mar 22, 2011 at 11:20 AM, guru 
>>>>>> wrote:
>>>>>> > > Hi geeks,
>>>>>> > >tomorrow i am having Amazon.com's Coding round followed by
>>>>>> > > Interview...pls suggest some tips to help me out...
>>>>>> >
>>>>>> > > --
>>>>>> > > 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 this group, send email to
>>>>>> > > algogeeks+unsubscr...@googlegroups.com.
>>>>>> > > For more options, visit this group at
>>>>>> > >http://groups.google.com/group/algogeeks?hl=en.
>>>>>>
>>>>>> --
>>>>>> 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 this group, send email to
>>>>>> algogeeks+unsubscr...@googlegroups.com.
>>>>>> For more options, visit this group at
>>>>>> http://groups.google.com/group/algogeeks?hl=en.
>>>>>>
>>>>>>
>>>>>  --
>>>>> 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 this group, send email to
>>>>> algogeeks+unsubscr...@googlegroups.com.
>>>>> For more options, visit this group at
>>>>> http://groups.google.com/group/algogeeks?hl=en.
>>>>>
>>>>
>&g

Re: [algogeeks] Re: Coding Round

[balaji a]

First I had a paper pen coding round. The questions were:
  1) There are two sorted linked lists. Write a code to return the merged
linked list which is also sorted. No additional nodes must be used.
  2) Design a DS that would do Push(),Pop(), and GetMax() elements at
complexity O(1)
  3) Do a BFS in given binary tree do find whether the given element in the
tree or not.

I got shortlisted and I attended three interview rounds.
Round 1:
   It was a kind of debugging round. The questions were:
   1) Consider you are given a mobile alarm application how will u test
it
   2) Consider ur gmail chat box is not working for a particular person
alone, wht will u do to find the problem
   3) I was given a program (without the code - black box testing) and
asked to write the test cases for it
   4) A program was given and asked to debug - was simple only

  Round 2:
It was an algorithm designing round.
1) Consider there is an array with duplicates and u r given two
numbers as input and u have to return the minimum distance between the two
in the array with minimum complexity.
2) For a normal Binary tree write the code for inorder traversal
without recursion
3) Given an array and an number find all the pairs in the array that
would add up to the given number. This also with minimum complexity.

 Round 3:
It was also coding round
1) There is an array and the distance between any two consequent
elements is one(+1 or -1) and given a number. You have to check whether the
number is in array or not with minimum complexity.


On Thu, Mar 24, 2011 at 12:11 AM, Akash Mukherjee wrote:

> kul man...wud appreciate if u cud post your question
>
> On Wed, Mar 23, 2011 at 11:28 PM, balaji a wrote:
>
>> hi i got till the third round of technical interview out of the four
>> rounds and got eliminated in third round.anyways thnx for ur support
>> dude :-)
>>
>>
>> On Tue, Mar 22, 2011 at 12:51 PM, balaji a wrote:
>>
>>> Thnx :-) I am from SSN College of Engineering,Chennai
>>>
>>>
>>> On Tue, Mar 22, 2011 at 12:28 PM, Akash Mukherjee wrote:
>>>
>>>> u r welcome :), nd all the best for ur test.btw, which clg??
>>>>
>>>>
>>>> On Tue, Mar 22, 2011 at 11:45 AM, guru  wrote:
>>>>
>>>>> Thank you very much for the info friendAnd sure will give u a
>>>>> treat :-)
>>>>>
>>>>> On Mar 22, 11:02 am, Akash Mukherjee  wrote:
>>>>> > hey, dis is what i was told by a friend working @ amazon -
>>>>> >
>>>>> > Sometimes they do go to the level of the subject basics like OS or DS
>>>>> but
>>>>> > you should be able to tackle these if you had studied well. No
>>>>> separate prep
>>>>> > is needed.
>>>>> >
>>>>> > Few Favs DS & Algos ( i should get treat for revealing this.;)... )
>>>>> > 1) All Trees (Binary for sure)
>>>>> > 2) Graphs
>>>>> > 3) Sorting Algos
>>>>> > 4) Heaps
>>>>> > "Let us C" ... though clichéd gives a good insight. If you can find
>>>>> time.
>>>>> >
>>>>> > can u tell a bit more about your profile?? fresher??
>>>>> >
>>>>> > On Tue, Mar 22, 2011 at 11:20 AM, guru 
>>>>> wrote:
>>>>> > > Hi geeks,
>>>>> > >tomorrow i am having Amazon.com's Coding round followed by
>>>>> > > Interview...pls suggest some tips to help me out...
>>>>> >
>>>>> > > --
>>>>> > > 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 this group, send email to
>>>>> > > algogeeks+unsubscr...@googlegroups.com.
>>>>> > > For more options, visit this group at
>>>>> > >http://groups.google.com/group/algogeeks?hl=en.
>>>>>
>>>>> --
>>>>> 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 this group, send email to
>>>>> algogeeks+unsubscr...@googlegroups.com.
>>>>> For more options, visit this group at
>

Re: [algogeeks] Re: Coding Round

[balaji a]

hi i got till the third round of technical interview out of the four rounds
and got eliminated in third round.anyways thnx for ur support dude :-)

On Tue, Mar 22, 2011 at 12:51 PM, balaji a  wrote:

> Thnx :-) I am from SSN College of Engineering,Chennai
>
>
> On Tue, Mar 22, 2011 at 12:28 PM, Akash Mukherjee wrote:
>
>> u r welcome :), nd all the best for ur test.btw, which clg??
>>
>>
>> On Tue, Mar 22, 2011 at 11:45 AM, guru  wrote:
>>
>>> Thank you very much for the info friendAnd sure will give u a
>>> treat :-)
>>>
>>> On Mar 22, 11:02 am, Akash Mukherjee  wrote:
>>> > hey, dis is what i was told by a friend working @ amazon -
>>> >
>>> > Sometimes they do go to the level of the subject basics like OS or DS
>>> but
>>> > you should be able to tackle these if you had studied well. No separate
>>> prep
>>> > is needed.
>>> >
>>> > Few Favs DS & Algos ( i should get treat for revealing this.;)... )
>>> > 1) All Trees (Binary for sure)
>>> > 2) Graphs
>>> > 3) Sorting Algos
>>> > 4) Heaps
>>> > "Let us C" ... though clichéd gives a good insight. If you can find
>>> time.
>>> >
>>> > can u tell a bit more about your profile?? fresher??
>>> >
>>> > On Tue, Mar 22, 2011 at 11:20 AM, guru 
>>> wrote:
>>> > > Hi geeks,
>>> > >tomorrow i am having Amazon.com's Coding round followed by
>>> > > Interview...pls suggest some tips to help me out...
>>> >
>>> > > --
>>> > > 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 this group, send email to
>>> > > algogeeks+unsubscr...@googlegroups.com.
>>> > > For more options, visit this group at
>>> > >http://groups.google.com/group/algogeeks?hl=en.
>>>
>>> --
>>> 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 this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com.
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>>
>>  --
>> 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 this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>
>
> --
> A.Balaji
>
>


-- 
A.Balaji

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: Coding Round

[balaji a]

Thnx :-) I am from SSN College of Engineering,Chennai

On Tue, Mar 22, 2011 at 12:28 PM, Akash Mukherjee wrote:

> u r welcome :), nd all the best for ur test.btw, which clg??
>
>
> On Tue, Mar 22, 2011 at 11:45 AM, guru  wrote:
>
>> Thank you very much for the info friendAnd sure will give u a
>> treat :-)
>>
>> On Mar 22, 11:02 am, Akash Mukherjee  wrote:
>> > hey, dis is what i was told by a friend working @ amazon -
>> >
>> > Sometimes they do go to the level of the subject basics like OS or DS
>> but
>> > you should be able to tackle these if you had studied well. No separate
>> prep
>> > is needed.
>> >
>> > Few Favs DS & Algos ( i should get treat for revealing this.;)... )
>> > 1) All Trees (Binary for sure)
>> > 2) Graphs
>> > 3) Sorting Algos
>> > 4) Heaps
>> > "Let us C" ... though clichéd gives a good insight. If you can find
>> time.
>> >
>> > can u tell a bit more about your profile?? fresher??
>> >
>> > On Tue, Mar 22, 2011 at 11:20 AM, guru  wrote:
>> > > Hi geeks,
>> > >tomorrow i am having Amazon.com's Coding round followed by
>> > > Interview...pls suggest some tips to help me out...
>> >
>> > > --
>> > > 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 this group, send email to
>> > > algogeeks+unsubscr...@googlegroups.com.
>> > > For more options, visit this group at
>> > >http://groups.google.com/group/algogeeks?hl=en.
>>
>> --
>> 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 this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>>
>  --
> 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 this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
A.Balaji

-- 
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 this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.