Hi,
I dont remember the question text exactly but the following should
convey it well
The question:
A number is said to be an additive number if it has the following format:
3268126844 : 32 6812 6844 : 32 + 6812 = 6844
123581321 : 1 2 3 5 8 13 21 : 1+2 = 3 , 2+3 = 5 , 3+5=8, 5+8 = 13, 8+13 -2
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Best,
T Anand Karthik,
Contact number: +91-9571552652
--
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
(!printf("Hello"))
On Jun 3, 2011 11:52 AM, "Arpit Mittal" wrote:
> Please help me in this question.
>
> What's the "condition" so that the following code prints both HelloWorld !
>
> if "condition"
> printf ("Hello");
> else
> printf("World");
>
>
>
>
> --
> -Arpit Mittal
> 6th Semester,
> Indian
How can that be unless 3 has two "next" nodes?
--
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.
Thanks a lot
On Sun, Apr 24, 2011 at 5:57 AM, Charles Turner wrote:
> This is a good book, now available to read online!
>
> http://www.iecc.com/linker/
>
> Charles
>
> On 24/04/2011 12:57, anand karthik wrote:
>>
>> I have been trying to find some good reding
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.
>
--
Best,
T Anand Karthik,
Contact number:
E
On Apr 4, 2011 1:14 PM, "Lavesh Rawat" wrote:
> *WHAT AM I Problem Solution*
> *
> *The beginning of eternity. The end of time and space. The beginning of
> every end and the end of every place. What am I?
>
> *Update Your Answers at *: Click
> Here<
http://dailybrainteaser.blogspot.com/2011/04/
s 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
Evertime you conduct a race, you eliminate 2 horses. So, 11.
On Mar 28, 2011 1:24 PM, "Lavesh Rawat" wrote:
> *Horse Race Problem Solution*
> *
> *Ok, so there are 25 horses and the race track only allows 5 horses to
race
> at a given time. Given that there is no stop watch available your task is
First start 7 & 4. Turn 4 as soon as it is over. Then turn 7 as soon as it
is over. By this time 7 minutes are gone and there is one minute left in 4.
So by the time 4 is over, 7 has 6 mintes left. Then immediately invert 7,
which will count the last one Minute.
7,4 - 3,0 - 3,4 - 0,1 - 7,1 - 6,0 -
Can anyone suggest an algorithmic approach?
On Mar 16, 2011 9:08 PM, "annarao naidu kataru"
wrote:
> i tried so many but the possible answer is 50 as u said
> thank u
>
> On Wed, Mar 16, 2011 at 8:08 PM, Gunjan Sharma wrote:
>
>> 10 what about this??
>>
>> --
>> You received this m
up.
> 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.
>
--
Best,
T Anand Kart
is message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algoge...@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com
>> .
>> For
13 matches
Mail list logo
