date:20110506

Re: [algogeeks]

2011-05-06 Thread hary rathor

@venkatesan

now you give the algorithm ... of O(n)

-- 
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]

2011-05-06 Thread venkatesan B

is O(n) solution possible



From: abhijith reddy 
To: algogeeks@googlegroups.com
Sent: Friday, 6 May 2011 9:47 PM
Subject: Re: [algogeeks]


dp1[i][j] will hold 1/0 depending upon whether string str[i...j] is a 
palindrome or not.
Now let dp2[i][j] be the minimum number of cuts required to split it into 
palindromes.
if str[i...j] is a palindrome then '0' cuts are required.
To get the number of cuts required for str[i...j] we try all possible positions 
between i & j and take minimum of all.


On Fri, May 6, 2011 at 8:23 PM, sourabh jakhar  wrote:

can you explain the logic
>
>
>
>On Fri, May 6, 2011 at 8:02 PM, abhijith reddy  
>wrote:
>
>O(N^3) DP
>>-
>>char str[MAX];
>>int dp1[MAX][MAX],dp2[MAX][MAX];
>>
>>int isPalin(int low,int high)
>>{
>>    if(low>=high) return 1;
>>    if(dp1[low][high]!=-1) return dp1[low][high];
>>    return dp1[low][high]=(str[low]==str[high])?isPalin(low+1,high-1):0;
>>}
>>
>>int minCuts(int low,int high)
>>{
>>    if(isPalin(low,high)) return 0;
>>    if(dp2[low][high]!=-1) return dp2[low][high];
>>    int ans=1e9;
>>    for(int i=low;i>        ans=min(ans,1+minCuts(low,i)+minCuts(i+1,high));
>>    return dp2[low][high]=ans;
>>}
>>
>>-
>>
>>
>>
>>On Fri, May 6, 2011 at 4:23 PM, sourabh jakhar  
>>wrote:
>>
>>You are given a large string. You need to cut the string into chunks such 
>>that each 
substring that you get is a palindrome. Remember that each 1 length 
string is always a palindrome. You need to find the minimum number of 
cuts that you need to make such that each substring is a palindrome. 
>>>
>>>-- 
>>>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.
>>
>
>
>-- 
>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] PHP E-Book

2011-05-06 Thread somya mishra

o riley is good

On Sat, May 7, 2011 at 2:21 AM, Aniket  wrote:

> Please suggest me a standard PHP book.I know there are lots in the
> internet.But as I am a beginner I want suggestions.Also if possible
> send the book or give me the link.Thanks in advance.
>
> --
> 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.

[algogeeks] PHP E-Book

2011-05-06 Thread Aniket

Please suggest me a standard PHP book.I know there are lots in the
internet.But as I am a beginner I want suggestions.Also if possible
send the book or give me the link.Thanks in advance.

-- 
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: If any one have algorithms for interviews by adnan aziz ebook... Please mail ...

2011-05-06 Thread sanchit mittal

email dis buk to me too... sm14it...@gmail.com

-- 
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.

[algogeeks] Poker Game

2011-05-06 Thread Ashish Goel

We have been given a deck of cards and each combination has a rating eg 3 As
is higher than 2 As 1K etc.

Write an algorithm such that the probability of picking 3 or 5 or 7 cards
from the deck results in high rating.


I understand that such a question has been asked in Amazon


Best Regards
Ashish Goel
"Think positive and find fuel in failure"
+919985813081
+919966006652

-- 
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.

[algogeeks] Run for a google years

2011-05-06 Thread Don

What is the shortest single line in a C program which will take more
than a google years to execute, but will eventually complete? You are
permitted to have code before or after the line, but execution of the
code must remain on that line, meaning no function calls, etc. Assume
a processor which executes 1 billion operations a second.

-- 
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]

2011-05-06 Thread abhijith reddy

dp1[i][j] will hold 1/0 depending upon whether string str[i...j] is a
palindrome or not.
Now let dp2[i][j] be the minimum number of cuts required to split it into
palindromes.
if str[i...j] is a palindrome then '0' cuts are required.
To get the number of cuts required for str[i...j] we try all possible
positions between i & j and take minimum of all.

On Fri, May 6, 2011 at 8:23 PM, sourabh jakhar wrote:

> can you explain the logic
>
>
> On Fri, May 6, 2011 at 8:02 PM, abhijith reddy 
> wrote:
>
>> O(N^3) DP
>>
>> -
>> char str[MAX];
>> int dp1[MAX][MAX],dp2[MAX][MAX];
>>
>> int isPalin(int low,int high)
>> {
>> if(low>=high) return 1;
>> if(dp1[low][high]!=-1) return dp1[low][high];
>> return dp1[low][high]=(str[low]==str[high])?isPalin(low+1,high-1):0;
>> }
>>
>> int minCuts(int low,int high)
>> {
>> if(isPalin(low,high)) return 0;
>> if(dp2[low][high]!=-1) return dp2[low][high];
>> int ans=1e9;
>> for(int i=low;i> ans=min(ans,1+minCuts(low,i)+minCuts(i+1,high));
>> return dp2[low][high]=ans;
>> }
>>
>>
>> -
>>
>>
>> On Fri, May 6, 2011 at 4:23 PM, sourabh jakhar 
>> wrote:
>>
>>> You are given a large string. You need to cut the string into chunks such
>>> that each substring that you get is a palindrome. Remember that each 1
>>> length string is always a palindrome. You need to find the minimum number of
>>> cuts that you need to make such that each substring is a palindrome.
>>> 
>>>
>>> --
>>> 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.
>>
>
>
>
> --
> 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] Re: If any one have algorithms for interviews by adnan aziz ebook... Please mail ...

2011-05-06 Thread Mitch Granger

If only there were some sort of mailing list where we could _all_ be
emailed... hmmm.

Given a mailing list of size N where everybody wants to receive book B
what is the most efficient algorithm to distribute the book? ;-)

On Fri, May 6, 2011 at 6:09 AM, Rohit J.  wrote:
> email.rohit.n...@gmail.com
>
> Thanks :)
>
>
> Regards
> Rohit
>
> On 5/6/11, naresh kumar  wrote:
>> Pleas mail to me also...
>> naresh.sac...@gmail.com
>> Thanks in advance
>>
>> On Fri, May 6, 2011 at 1:46 AM, Ashish Modi  wrote:
>>
>>> Hello,
>>> Can  you please mail me ashishrmod...@gmail.com
>>>
>>> Thanks in advance
>>>
>>> --
>>> With Regards
>>> Ashish
>>>
>>> --
>>> 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.
>
>

-- 
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]

2011-05-06 Thread sourabh jakhar

can you explain the logic

On Fri, May 6, 2011 at 8:02 PM, abhijith reddy wrote:

> O(N^3) DP
>
> -
> char str[MAX];
> int dp1[MAX][MAX],dp2[MAX][MAX];
>
> int isPalin(int low,int high)
> {
> if(low>=high) return 1;
> if(dp1[low][high]!=-1) return dp1[low][high];
> return dp1[low][high]=(str[low]==str[high])?isPalin(low+1,high-1):0;
> }
>
> int minCuts(int low,int high)
> {
> if(isPalin(low,high)) return 0;
> if(dp2[low][high]!=-1) return dp2[low][high];
> int ans=1e9;
> for(int i=low;i ans=min(ans,1+minCuts(low,i)+minCuts(i+1,high));
> return dp2[low][high]=ans;
> }
>
>
> -
>
>
> On Fri, May 6, 2011 at 4:23 PM, sourabh jakhar wrote:
>
>> You are given a large string. You need to cut the string into chunks such
>> that each substring that you get is a palindrome. Remember that each 1
>> length string is always a palindrome. You need to find the minimum number of
>> cuts that you need to make such that each substring is a palindrome.
>> 
>>
>> --
>> 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.
>



-- 
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]

2011-05-06 Thread abhijith reddy

O(N^3) DP
-
char str[MAX];
int dp1[MAX][MAX],dp2[MAX][MAX];

int isPalin(int low,int high)
{
if(low>=high) return 1;
if(dp1[low][high]!=-1) return dp1[low][high];
return dp1[low][high]=(str[low]==str[high])?isPalin(low+1,high-1):0;
}

int minCuts(int low,int high)
{
if(isPalin(low,high)) return 0;
if(dp2[low][high]!=-1) return dp2[low][high];
int ans=1e9;
for(int i=low;iwrote:

> You are given a large string. You need to cut the string into chunks such
> that each substring that you get is a palindrome. Remember that each 1
> length string is always a palindrome. You need to find the minimum number of
> cuts that you need to make such that each substring is a palindrome.
> 
>
> --
> 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] Re: LARGEST NUMBER PUZZLE 6 MAY

2011-05-06 Thread Rohit J.

On 5/6/11, Malay Bag  wrote:
> why not (...((9!^9!)!)!)! or so? there should be some limit on number of
> operators
Indeed. So, in this case answer will be infinity :).

-- 
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: LARGEST NUMBER PUZZLE 6 MAY

2011-05-06 Thread Malay Bag

why not (...((9!^9!)!)!)! or so? there should be some limit on number of
operators

On Fri, May 6, 2011 at 6:32 PM, Rohit J.  wrote:

> I think
> (9!^9!)! is the correct answer.
> 1/0 is not because to be precise it's not defined.
> Lim(x ->0) 1/x is infinity. :)
>
> Cheers
> Rohit
>
> On 5/6/11, subramania jeeva  wrote:
> > (9! pow 9! ) ! :)
> >
> >
> >
> >
> >
> >
> >
> > Cheers
> >   ~ Jeeva ~
> >
> >
> > On Fri, May 6, 2011 at 6:22 PM, sourabh jakhar
> > wrote:
> >
> >> @manjeet
> >> you are genious go for google
> >>
> >>
> >> On Fri, May 6, 2011 at 5:09 PM, ps.raghuchan...@gmail.com <
> >> ps.raghuchan...@gmail.com> wrote:
> >>
> >>> @manjeet ...heheheheheh
> >>>
> >>>
> >>> On Fri, May 6, 2011 at 5:08 PM, Manjeet Chayel
> >>> wrote:
> >>>
>  1/0
> 
> 
>  On Fri, May 6, 2011 at 5:06 PM, sourabh jakhar
>  wrote:
> 
> > what about 9!pow9!
> >
> >
> > On Fri, May 6, 2011 at 5:04 PM, RAghu  >wrote:
> >
> >> What about (9 pow 9) !
> >>
> >> On May 6, 4:30 pm, uday kumar  wrote:
> >> > 9 pow 9.
> >> >
> >> > On Fri, May 6, 2011 at 3:41 PM, Bala  wrote:
> >> > > 99!
> >> >
> >> > > Thanks
> >> > > Bala
> >> >
> >> > > On Fri, May 6, 2011 at 2:48 PM, Lavesh Rawat <
> >> lavesh.ra...@gmail.com>wrote:
> >> >
> >> > >>  *
> >> > >>  LARGEST NUMBER PUZZLE
> >> >
> >> > >> What is the largest number you can get using only 2 digits?
> >> >
> >> > >> Update Your Answers at : Click Here<
> >>
> http://dailybrainteaser.blogspot.com/2011/05/largest-number-puzzle-6-..
> >> .>
> >> >
> >> > >> 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.
> >>
> >> --
> >> 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.
> >
> 
> 
> 
>  --
>  Cheers!!
>  Manjeet Chayel
> 
>   --
>  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.
> 
> >>>
> >>>
> >>>
> >>> --
> >>> P.S.Raghu Chandra,
> >>> IIIT Allahabad,
> >>> B.Tech 8th sem.
> >>>
> >>> ps.raghuchan...@gmail.com
> >>>
> >>>  --
> >>> 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: If any one have algorithms for interviews by adnan aziz ebook... Please mail ...

2011-05-06 Thread Rohit J.

email.rohit.n...@gmail.com

Thanks :)


Regards
Rohit

On 5/6/11, naresh kumar  wrote:
> Pleas mail to me also...
> naresh.sac...@gmail.com
> Thanks in advance
>
> On Fri, May 6, 2011 at 1:46 AM, Ashish Modi  wrote:
>
>> Hello,
>> Can  you please mail me ashishrmod...@gmail.com
>>
>> Thanks in advance
>>
>> --
>> With Regards
>> Ashish
>>
>> --
>> 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] Re: LARGEST NUMBER PUZZLE 6 MAY

2011-05-06 Thread Rohit J.

I think
(9!^9!)! is the correct answer.
1/0 is not because to be precise it's not defined.
Lim(x ->0) 1/x is infinity. :)

Cheers
Rohit

On 5/6/11, subramania jeeva  wrote:
> (9! pow 9! ) ! :)
>
>
>
>
>
>
>
> Cheers
>   ~ Jeeva ~
>
>
> On Fri, May 6, 2011 at 6:22 PM, sourabh jakhar
> wrote:
>
>> @manjeet
>> you are genious go for google
>>
>>
>> On Fri, May 6, 2011 at 5:09 PM, ps.raghuchan...@gmail.com <
>> ps.raghuchan...@gmail.com> wrote:
>>
>>> @manjeet ...heheheheheh
>>>
>>>
>>> On Fri, May 6, 2011 at 5:08 PM, Manjeet Chayel
>>> wrote:
>>>
 1/0


 On Fri, May 6, 2011 at 5:06 PM, sourabh jakhar
 wrote:

> what about 9!pow9!
>
>
> On Fri, May 6, 2011 at 5:04 PM, RAghu wrote:
>
>> What about (9 pow 9) !
>>
>> On May 6, 4:30 pm, uday kumar  wrote:
>> > 9 pow 9.
>> >
>> > On Fri, May 6, 2011 at 3:41 PM, Bala  wrote:
>> > > 99!
>> >
>> > > Thanks
>> > > Bala
>> >
>> > > On Fri, May 6, 2011 at 2:48 PM, Lavesh Rawat <
>> lavesh.ra...@gmail.com>wrote:
>> >
>> > >>  *
>> > >>  LARGEST NUMBER PUZZLE
>> >
>> > >> What is the largest number you can get using only 2 digits?
>> >
>> > >> Update Your Answers at : Click Here<
>> http://dailybrainteaser.blogspot.com/2011/05/largest-number-puzzle-6-..
>> .>
>> >
>> > >> 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.
>>
>> --
>> 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.
>



 --
 Cheers!!
 Manjeet Chayel

  --
 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.

>>>
>>>
>>>
>>> --
>>> P.S.Raghu Chandra,
>>> IIIT Allahabad,
>>> B.Tech 8th sem.
>>>
>>> ps.raghuchan...@gmail.com
>>>
>>>  --
>>> 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

Re: [algogeeks] GOOGLE INTERVIEW QUESTION

2011-05-06 Thread sourabh jakhar

On Fri, May 6, 2011 at 4:23 PM, sourabh jakhar wrote:

> You are given a large string. You need to cut the string into chunks such
> that each substring that you get is a palindrome. Remember that each 1
> length string is always a palindrome. You need to find the minimum number of
> cuts that you need to make such that each substring is a palindrome.
> 
>
> --
> 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.
>



-- 
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] Re: LARGEST NUMBER PUZZLE 6 MAY

2011-05-06 Thread subramania jeeva

(9! pow 9! ) ! :)







Cheers
  ~ Jeeva ~


On Fri, May 6, 2011 at 6:22 PM, sourabh jakhar wrote:

> @manjeet
> you are genious go for google
>
>
> On Fri, May 6, 2011 at 5:09 PM, ps.raghuchan...@gmail.com <
> ps.raghuchan...@gmail.com> wrote:
>
>> @manjeet ...heheheheheh
>>
>>
>> On Fri, May 6, 2011 at 5:08 PM, Manjeet Chayel 
>> wrote:
>>
>>> 1/0
>>>
>>>
>>> On Fri, May 6, 2011 at 5:06 PM, sourabh jakhar 
>>> wrote:
>>>
 what about 9!pow9!


 On Fri, May 6, 2011 at 5:04 PM, RAghu wrote:

> What about (9 pow 9) !
>
> On May 6, 4:30 pm, uday kumar  wrote:
> > 9 pow 9.
> >
> > On Fri, May 6, 2011 at 3:41 PM, Bala  wrote:
> > > 99!
> >
> > > Thanks
> > > Bala
> >
> > > On Fri, May 6, 2011 at 2:48 PM, Lavesh Rawat <
> lavesh.ra...@gmail.com>wrote:
> >
> > >>  *
> > >>  LARGEST NUMBER PUZZLE
> >
> > >> What is the largest number you can get using only 2 digits?
> >
> > >> Update Your Answers at : Click Here<
> http://dailybrainteaser.blogspot.com/2011/05/largest-number-puzzle-6-..
> .>
> >
> > >> 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.
>
> --
> 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.

>>>
>>>
>>>
>>> --
>>> Cheers!!
>>> Manjeet Chayel
>>>
>>>  --
>>> 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.
>>>
>>
>>
>>
>> --
>> P.S.Raghu Chandra,
>> IIIT Allahabad,
>> B.Tech 8th sem.
>>
>> ps.raghuchan...@gmail.com
>>
>>  --
>> 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:/

Re: [algogeeks] GOOGLE INTERVIEW QUESTION

2011-05-06 Thread sourabh jakhar

On Fri, May 6, 2011 at 4:23 PM, sourabh jakhar wrote:

> You are given a large string. You need to cut the string into chunks such
> that each substring that you get is a palindrome. Remember that each 1
> length string is always a palindrome. You need to find the minimum number of
> cuts that you need to make such that each substring is a palindrome.
> 
>
> --
> 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.
>



-- 
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] Re: LARGEST NUMBER PUZZLE 6 MAY

2011-05-06 Thread sourabh jakhar

@manjeet
you are genious go for google

On Fri, May 6, 2011 at 5:09 PM, ps.raghuchan...@gmail.com <
ps.raghuchan...@gmail.com> wrote:

> @manjeet ...heheheheheh
>
>
> On Fri, May 6, 2011 at 5:08 PM, Manjeet Chayel 
> wrote:
>
>> 1/0
>>
>>
>> On Fri, May 6, 2011 at 5:06 PM, sourabh jakhar 
>> wrote:
>>
>>> what about 9!pow9!
>>>
>>>
>>> On Fri, May 6, 2011 at 5:04 PM, RAghu  wrote:
>>>
 What about (9 pow 9) !

 On May 6, 4:30 pm, uday kumar  wrote:
 > 9 pow 9.
 >
 > On Fri, May 6, 2011 at 3:41 PM, Bala  wrote:
 > > 99!
 >
 > > Thanks
 > > Bala
 >
 > > On Fri, May 6, 2011 at 2:48 PM, Lavesh Rawat <
 lavesh.ra...@gmail.com>wrote:
 >
 > >>  *
 > >>  LARGEST NUMBER PUZZLE
 >
 > >> What is the largest number you can get using only 2 digits?
 >
 > >> Update Your Answers at : Click Here<
 http://dailybrainteaser.blogspot.com/2011/05/largest-number-puzzle-6-..
 .>
 >
 > >> 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.

 --
 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.
>>>
>>
>>
>>
>> --
>> Cheers!!
>> Manjeet Chayel
>>
>>  --
>> 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.
>>
>
>
>
> --
> P.S.Raghu Chandra,
> IIIT Allahabad,
> B.Tech 8th sem.
>
> ps.raghuchan...@gmail.com
>
>  --
> 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] LARGEST NUMBER PUZZLE 6 MAY

2011-05-06 Thread Bala

99!

Thanks
Bala


On Fri, May 6, 2011 at 2:48 PM, Lavesh Rawat  wrote:

> *
>  LARGEST NUMBER PUZZLE
>
> What is the largest number you can get using only 2 digits?
>
> 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.

[algogeeks] Re: LARGEST NUMBER PUZZLE 6 MAY

2011-05-06 Thread RAghu

What about (9 pow 9) !

On May 6, 4:30 pm, uday kumar  wrote:
> 9 pow 9.
>
> On Fri, May 6, 2011 at 3:41 PM, Bala  wrote:
> > 99!
>
> > Thanks
> > Bala
>
> > On Fri, May 6, 2011 at 2:48 PM, Lavesh Rawat wrote:
>
> >>  *
> >>  LARGEST NUMBER PUZZLE
>
> >> What is the largest number you can get using only 2 digits?
>
> >> 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.

-- 
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: LARGEST NUMBER PUZZLE 6 MAY

2011-05-06 Thread sourabh jakhar

what about 9!pow9!

On Fri, May 6, 2011 at 5:04 PM, RAghu  wrote:

> What about (9 pow 9) !
>
> On May 6, 4:30 pm, uday kumar  wrote:
> > 9 pow 9.
> >
> > On Fri, May 6, 2011 at 3:41 PM, Bala  wrote:
> > > 99!
> >
> > > Thanks
> > > Bala
> >
> > > On Fri, May 6, 2011 at 2:48 PM, Lavesh Rawat  >wrote:
> >
> > >>  *
> > >>  LARGEST NUMBER PUZZLE
> >
> > >> What is the largest number you can get using only 2 digits?
> >
> > >> Update Your Answers at : Click Here<
> http://dailybrainteaser.blogspot.com/2011/05/largest-number-puzzle-6-...>
> >
> > >> 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.
>
> --
> 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] LARGEST NUMBER PUZZLE 6 MAY

2011-05-06 Thread uday kumar

9 pow 9.

On Fri, May 6, 2011 at 3:41 PM, Bala  wrote:

> 99!
>
> Thanks
> Bala
>
>
>
> On Fri, May 6, 2011 at 2:48 PM, Lavesh Rawat wrote:
>
>>  *
>>  LARGEST NUMBER PUZZLE
>>
>> What is the largest number you can get using only 2 digits?
>>
>> 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.
>

-- 
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: LARGEST NUMBER PUZZLE 6 MAY

2011-05-06 Thread ps.raghuchan...@gmail.com

@manjeet ...heheheheheh

On Fri, May 6, 2011 at 5:08 PM, Manjeet Chayel wrote:

> 1/0
>
>
> On Fri, May 6, 2011 at 5:06 PM, sourabh jakhar wrote:
>
>> what about 9!pow9!
>>
>>
>> On Fri, May 6, 2011 at 5:04 PM, RAghu  wrote:
>>
>>> What about (9 pow 9) !
>>>
>>> On May 6, 4:30 pm, uday kumar  wrote:
>>> > 9 pow 9.
>>> >
>>> > On Fri, May 6, 2011 at 3:41 PM, Bala  wrote:
>>> > > 99!
>>> >
>>> > > Thanks
>>> > > Bala
>>> >
>>> > > On Fri, May 6, 2011 at 2:48 PM, Lavesh Rawat >> >wrote:
>>> >
>>> > >>  *
>>> > >>  LARGEST NUMBER PUZZLE
>>> >
>>> > >> What is the largest number you can get using only 2 digits?
>>> >
>>> > >> Update Your Answers at : Click Here<
>>> http://dailybrainteaser.blogspot.com/2011/05/largest-number-puzzle-6-..
>>> .>
>>> >
>>> > >> 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.
>>>
>>> --
>>> 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.
>>
>
>
>
> --
> Cheers!!
> Manjeet Chayel
>
>  --
> 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.
>



-- 
P.S.Raghu Chandra,
IIIT Allahabad,
B.Tech 8th sem.

ps.raghuchan...@gmail.com

-- 
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: LARGEST NUMBER PUZZLE 6 MAY

2011-05-06 Thread ps.raghuchan...@gmail.com

I think 9! pow 9! is smaller than (9 pow 9)!

On Fri, May 6, 2011 at 5:06 PM, sourabh jakhar wrote:

> what about 9!pow9!
>
>
> On Fri, May 6, 2011 at 5:04 PM, RAghu  wrote:
>
>> What about (9 pow 9) !
>>
>> On May 6, 4:30 pm, uday kumar  wrote:
>> > 9 pow 9.
>> >
>> > On Fri, May 6, 2011 at 3:41 PM, Bala  wrote:
>> > > 99!
>> >
>> > > Thanks
>> > > Bala
>> >
>> > > On Fri, May 6, 2011 at 2:48 PM, Lavesh Rawat > >wrote:
>> >
>> > >>  *
>> > >>  LARGEST NUMBER PUZZLE
>> >
>> > >> What is the largest number you can get using only 2 digits?
>> >
>> > >> Update Your Answers at : Click Here<
>> http://dailybrainteaser.blogspot.com/2011/05/largest-number-puzzle-6-...>
>> >
>> > >> 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.
>>
>> --
>> 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.
>



-- 
P.S.Raghu Chandra,
IIIT Allahabad,
B.Tech 8th sem.

ps.raghuchan...@gmail.com

-- 
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: LARGEST NUMBER PUZZLE 6 MAY

2011-05-06 Thread Manjeet Chayel

1/0

On Fri, May 6, 2011 at 5:06 PM, sourabh jakhar wrote:

> what about 9!pow9!
>
>
> On Fri, May 6, 2011 at 5:04 PM, RAghu  wrote:
>
>> What about (9 pow 9) !
>>
>> On May 6, 4:30 pm, uday kumar  wrote:
>> > 9 pow 9.
>> >
>> > On Fri, May 6, 2011 at 3:41 PM, Bala  wrote:
>> > > 99!
>> >
>> > > Thanks
>> > > Bala
>> >
>> > > On Fri, May 6, 2011 at 2:48 PM, Lavesh Rawat > >wrote:
>> >
>> > >>  *
>> > >>  LARGEST NUMBER PUZZLE
>> >
>> > >> What is the largest number you can get using only 2 digits?
>> >
>> > >> Update Your Answers at : Click Here<
>> http://dailybrainteaser.blogspot.com/2011/05/largest-number-puzzle-6-...>
>> >
>> > >> 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.
>>
>> --
>> 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.
>



-- 
Cheers!!
Manjeet Chayel

-- 
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.

[algogeeks]

2011-05-06 Thread sourabh jakhar

You are given a large string. You need to cut the string into chunks such
that each substring that you get is a palindrome. Remember that each 1
length string is always a palindrome. You need to find the minimum number of
cuts that you need to make such that each substring is a palindrome.


-- 
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.

[algogeeks] ebooks required!!

2011-05-06 Thread karan sachan

Does anybody has a soft copy of these books or help me to search these
books:-

1) Java Collections by John Zukowski
2) Professional XML Development  with Apache Tools : Xerces,
Xalan,FOP,cocoon,Axis,Xidice
-- 

Thanks in advance!!

--
Karan Sachan
Mobile: +91 9663373478

-- 
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: [algogeeks]

Re: [algogeeks] PHP E-Book

[algogeeks] PHP E-Book

Re: [algogeeks] Re: If any one have algorithms for interviews by adnan aziz ebook... Please mail ...

[algogeeks] Poker Game

[algogeeks] Run for a google years

Re: [algogeeks]

Re: [algogeeks] Re: If any one have algorithms for interviews by adnan aziz ebook... Please mail ...

Re: [algogeeks]

Re: [algogeeks]

Re: [algogeeks] Re: LARGEST NUMBER PUZZLE 6 MAY

Re: [algogeeks] Re: LARGEST NUMBER PUZZLE 6 MAY

Re: [algogeeks] Re: If any one have algorithms for interviews by adnan aziz ebook... Please mail ...

Re: [algogeeks] Re: LARGEST NUMBER PUZZLE 6 MAY

Re: [algogeeks] GOOGLE INTERVIEW QUESTION

Re: [algogeeks] Re: LARGEST NUMBER PUZZLE 6 MAY

Re: [algogeeks] GOOGLE INTERVIEW QUESTION

Re: [algogeeks] Re: LARGEST NUMBER PUZZLE 6 MAY

Re: [algogeeks] LARGEST NUMBER PUZZLE 6 MAY

[algogeeks] Re: LARGEST NUMBER PUZZLE 6 MAY

Re: [algogeeks] Re: LARGEST NUMBER PUZZLE 6 MAY

Re: [algogeeks] LARGEST NUMBER PUZZLE 6 MAY

Re: [algogeeks] Re: LARGEST NUMBER PUZZLE 6 MAY

Re: [algogeeks] Re: LARGEST NUMBER PUZZLE 6 MAY

Re: [algogeeks] Re: LARGEST NUMBER PUZZLE 6 MAY

[algogeeks]

[algogeeks] ebooks required!!

28 matches

Site Navigation

Mail list logo

Footer information