Re: [algogeeks] novel written test
> AMIT TWO IN CASE OF ONLY 2 PIECES ARE TO BE JOINED. >>> >> ANSWER IS 4 AS U CAN CALCULATE I GUESS TO MAKE A STRAIGHT CHAIN FROM 3 BROKEN PIECES. -- 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] novel written test
ohh its a straight chain..nt a rounded one..
gt it
On Tue, Jun 28, 2011 at 12:42 PM, sagar pareek wrote:
> @amit
> Check out your IQ
>
> On Tue, Jun 28, 2011 at 2:43 AM, amit kumar wrote:
>
>> how 2??
>>
>>
>> On Tue, Jun 28, 2011 at 2:40 AM, gmagog...@gmail.com > > wrote:
>>
>>>
>>> if( links can be melt and made into smaller links )
>>> {
>>> return 1;
>>> }
>>> else
>>> {
>>> return 2;
>>> }
>>> Yanan Cao
>>>
>>>
>>>
>>> On Mon, Jun 27, 2011 at 4:09 PM, sourabh jakhar >> > wrote:
>>>
two
On Tue, Jun 28, 2011 at 2:23 AM, amit the cool >>> > wrote:
> A chain is broken into three pieces of equal lengths containing 3
> links each. It is taken to a back smith to join into a single
> continuous one . How many links are to be opened to make 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.
>
>
--
SOURABH JAKHAR,(CSE)(3 year)
ROOM NO 167 ,
TILAK,HOSTEL
'MNNIT ALLAHABAD
The Law of Win says, "Let's not do it your way or my way; let's do it
the best way."
--
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.
>>
>
>
>
> --
> **Regards
> SAGAR PAREEK
> COMPUTER SCIENCE AND ENGINEERING
> NIT ALLAHABAD
>
> --
> 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] novel written test
@amit
Check out your IQ
On Tue, Jun 28, 2011 at 2:43 AM, amit kumar wrote:
> how 2??
>
>
> On Tue, Jun 28, 2011 at 2:40 AM, gmagog...@gmail.com
> wrote:
>
>>
>> if( links can be melt and made into smaller links )
>> {
>> return 1;
>> }
>> else
>> {
>> return 2;
>> }
>> Yanan Cao
>>
>>
>>
>> On Mon, Jun 27, 2011 at 4:09 PM, sourabh jakhar
>> wrote:
>>
>>> two
>>>
>>>
>>> On Tue, Jun 28, 2011 at 2:23 AM, amit the cool
>>> wrote:
>>>
A chain is broken into three pieces of equal lengths containing 3
links each. It is taken to a back smith to join into a single
continuous one . How many links are to be opened to make 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.
>>>
>>>
>>> --
>>> SOURABH JAKHAR,(CSE)(3 year)
>>> ROOM NO 167 ,
>>> TILAK,HOSTEL
>>> 'MNNIT ALLAHABAD
>>>
>>> The Law of Win says, "Let's not do it your way or my way; let's do it the
>>> best way."
>>>
>>> --
>>> 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.
>
--
**Regards
SAGAR PAREEK
COMPUTER SCIENCE AND ENGINEERING
NIT ALLAHABAD
--
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] novel written test
ok piyush..u r right.well done On Tue, Jun 28, 2011 at 2:31 AM, Piyush Sinha wrote: > We just need to look the 3 set of number that multiply to 36... > > the set can be as > (1,1,36),(1,2,18),(1,4,9)..(1,6,6),(1,3,12)..(2,2,9) > > The catch here is we need not find the whole set...the second mathematician > can't guess their ages through their sum that means there are at least two > possible combination that sum to the same value.. > > we have 1,6,6 and 2,2,9 > > second clue says "my youngest is youngest"... > > if we look into the combination, we find the first set have unique age for > the youngest son..hence the ages.. > > and 2 sons can have same age without being twins...one born in the month of > jan and the other born in the month of december...:P :P > moreover its no where mentioned there can't be any twins > > On Tue, Jun 28, 2011 at 2:24 AM, amit kumar wrote: > >> @piyush..will u xplain plz. >> by d way 2 sons cant hav d same age(hope they r nt twins) >> >> On Tue, Jun 28, 2011 at 2:14 AM, Piyush Sinha >> wrote: >> >>> 1,6,6 >>> >>> >>> On Tue, Jun 28, 2011 at 2:07 AM, amit the cool >>> wrote: >>> Conversation between two mathematicians: first : I have three children. The product of their ages is 36 . If you sum their ages . it is exactly same as my neighbor's door number on my left. The second mathematician verifies the door number and says that the not sufficient . Then the first says " o.k one more clue is that my youngest is the youngest" Immediately the second mathematician answers . Can you answer the question asked by the first mathematician? What are the children ages? -- 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. >>> >>> >>> -- >>> *Piyush Sinha* >>> *IIIT, Allahabad* >>> *+91-8792136657* >>> *+91-7483122727* >>> *https://www.facebook.com/profile.php?id=10655377926 * >>> >>> -- >>> 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. >> > > > > -- > *Piyush Sinha* > *IIIT, Allahabad* > *+91-8792136657* > *+91-7483122727* > *https://www.facebook.com/profile.php?id=10655377926 * > > -- > 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] novel written test
how 2??
On Tue, Jun 28, 2011 at 2:40 AM, gmagog...@gmail.com wrote:
>
> if( links can be melt and made into smaller links )
> {
> return 1;
> }
> else
> {
> return 2;
> }
> Yanan Cao
>
>
>
> On Mon, Jun 27, 2011 at 4:09 PM, sourabh jakhar
> wrote:
>
>> two
>>
>>
>> On Tue, Jun 28, 2011 at 2:23 AM, amit the cool
>> wrote:
>>
>>> A chain is broken into three pieces of equal lengths containing 3
>>> links each. It is taken to a back smith to join into a single
>>> continuous one . How many links are to be opened to make 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.
>>>
>>>
>>
>>
>> --
>> SOURABH JAKHAR,(CSE)(3 year)
>> ROOM NO 167 ,
>> TILAK,HOSTEL
>> 'MNNIT ALLAHABAD
>>
>> The Law of Win says, "Let's not do it your way or my way; let's do it the
>> best way."
>>
>> --
>> 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.
Re: [algogeeks] novel written test
if( links can be melt and made into smaller links )
{
return 1;
}
else
{
return 2;
}
Yanan Cao
On Mon, Jun 27, 2011 at 4:09 PM, sourabh jakhar wrote:
> two
>
>
> On Tue, Jun 28, 2011 at 2:23 AM, amit the cool wrote:
>
>> A chain is broken into three pieces of equal lengths containing 3
>> links each. It is taken to a back smith to join into a single
>> continuous one . How many links are to be opened to make 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.
>>
>>
>
>
> --
> SOURABH JAKHAR,(CSE)(3 year)
> ROOM NO 167 ,
> TILAK,HOSTEL
> 'MNNIT ALLAHABAD
>
> The Law of Win says, "Let's not do it your way or my way; let's do it the
> best way."
>
> --
> 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] novel written test
two On Tue, Jun 28, 2011 at 2:23 AM, amit the cool wrote: > A chain is broken into three pieces of equal lengths containing 3 > links each. It is taken to a back smith to join into a single > continuous one . How many links are to be opened to make 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. > > -- SOURABH JAKHAR,(CSE)(3 year) ROOM NO 167 , TILAK,HOSTEL 'MNNIT ALLAHABAD The Law of Win says, "Let's not do it your way or my way; let's do it the best way." -- 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] novel written test
We just need to look the 3 set of number that multiply to 36... the set can be as (1,1,36),(1,2,18),(1,4,9)..(1,6,6),(1,3,12)..(2,2,9) The catch here is we need not find the whole set...the second mathematician can't guess their ages through their sum that means there are at least two possible combination that sum to the same value.. we have 1,6,6 and 2,2,9 second clue says "my youngest is youngest"... if we look into the combination, we find the first set have unique age for the youngest son..hence the ages.. and 2 sons can have same age without being twins...one born in the month of jan and the other born in the month of december...:P :P moreover its no where mentioned there can't be any twins On Tue, Jun 28, 2011 at 2:24 AM, amit kumar wrote: > @piyush..will u xplain plz. > by d way 2 sons cant hav d same age(hope they r nt twins) > > On Tue, Jun 28, 2011 at 2:14 AM, Piyush Sinha wrote: > >> 1,6,6 >> >> >> On Tue, Jun 28, 2011 at 2:07 AM, amit the cool >> wrote: >> >>> Conversation between two mathematicians: first : I have three >>> children. The product of their ages is 36 . If you sum their ages . it >>> is exactly same as my neighbor's door number on my left. The second >>> mathematician verifies the door number and says that the not >>> sufficient . Then the first says " o.k one more clue is that my >>> youngest is the youngest" Immediately the second mathematician >>> answers . Can you answer the question asked by the first >>> mathematician? What are the children ages? >>> >>> -- >>> 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. >>> >>> >> >> >> -- >> *Piyush Sinha* >> *IIIT, Allahabad* >> *+91-8792136657* >> *+91-7483122727* >> *https://www.facebook.com/profile.php?id=10655377926 * >> >> -- >> 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. > -- *Piyush Sinha* *IIIT, Allahabad* *+91-8792136657* *+91-7483122727* *https://www.facebook.com/profile.php?id=10655377926 * -- 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] novel written test
Is it required that no two sons have the same age? >From my view, the clue "my youngest is the youngest" only defines the requirement that "the youngest one is unique", but he can still have two older brothers of the same age. Please correct me if this is wrong. Yanan Cao On Mon, Jun 27, 2011 at 3:54 PM, amit kumar wrote: > @piyush..will u xplain plz. > by d way 2 sons cant hav d same age(hope they r nt twins) > > > On Tue, Jun 28, 2011 at 2:14 AM, Piyush Sinha wrote: > >> 1,6,6 >> >> >> On Tue, Jun 28, 2011 at 2:07 AM, amit the cool >> wrote: >> >>> Conversation between two mathematicians: first : I have three >>> children. The product of their ages is 36 . If you sum their ages . it >>> is exactly same as my neighbor's door number on my left. The second >>> mathematician verifies the door number and says that the not >>> sufficient . Then the first says " o.k one more clue is that my >>> youngest is the youngest" Immediately the second mathematician >>> answers . Can you answer the question asked by the first >>> mathematician? What are the children ages? >>> >>> -- >>> 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. >>> >>> >> >> >> -- >> *Piyush Sinha* >> *IIIT, Allahabad* >> *+91-8792136657* >> *+91-7483122727* >> *https://www.facebook.com/profile.php?id=10655377926 * >> >> -- >> 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.
Re: [algogeeks] novel written test
Since the product of their ages is 36. So the possible combination of ages may b: either 1 4 9 or 4 3 3 6 6 1 1 2 18 1 3 12 1 1 36 2 2 9 Now neighbor's door numbr gives the sum.. Here all gives uniq sum except (sum=13) So there will be doubt in either 6 6 1 or 2 2 9 Bt as mathematician said tat "youngest is the youngest" So 1 6 6 will be d final ans... Correct me if m wrong.. :) :) -- 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] novel written test
@piyush..will u xplain plz. by d way 2 sons cant hav d same age(hope they r nt twins) On Tue, Jun 28, 2011 at 2:14 AM, Piyush Sinha wrote: > 1,6,6 > > > On Tue, Jun 28, 2011 at 2:07 AM, amit the cool wrote: > >> Conversation between two mathematicians: first : I have three >> children. The product of their ages is 36 . If you sum their ages . it >> is exactly same as my neighbor's door number on my left. The second >> mathematician verifies the door number and says that the not >> sufficient . Then the first says " o.k one more clue is that my >> youngest is the youngest" Immediately the second mathematician >> answers . Can you answer the question asked by the first >> mathematician? What are the children ages? >> >> -- >> 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. >> >> > > > -- > *Piyush Sinha* > *IIIT, Allahabad* > *+91-8792136657* > *+91-7483122727* > *https://www.facebook.com/profile.php?id=10655377926 * > > -- > 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] novel written test
1,6,6 On Tue, Jun 28, 2011 at 2:07 AM, amit the cool wrote: > Conversation between two mathematicians: first : I have three > children. The product of their ages is 36 . If you sum their ages . it > is exactly same as my neighbor's door number on my left. The second > mathematician verifies the door number and says that the not > sufficient . Then the first says " o.k one more clue is that my > youngest is the youngest" Immediately the second mathematician > answers . Can you answer the question asked by the first > mathematician? What are the children ages? > > -- > 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. > > -- *Piyush Sinha* *IIIT, Allahabad* *+91-8792136657* *+91-7483122727* *https://www.facebook.com/profile.php?id=10655377926 * -- 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.
