Re: [algogeeks] Re: Microsoft Question!

2011-07-21 Thread archita monga
@aditi-the  algo is giving a problem when the last bit is 0..just like in ur
case..when the number is being reversed instead of 0010 it is giving only 10
and neglecting the initial 0's since dey do not contribute in the number..i
guess dis is d prob dat u r facing?

On Thu, Jul 21, 2011 at 9:57 PM, aditi garg wrote:

> i have tried solving so many tyms bt i dnt think dis also is wrking fine fr
> 0100 input..plz chk
>
>
> On Thu, Jul 21, 2011 at 9:49 PM, aditi garg wrote:
>
>> @ankit : smhow im not able to follow the steps ur also is taking fr input
>> 0100 ,tho its fine fr 1011 and im not getting the required ans...can u plz
>> explain...
>>
>>
>> On Thu, Jul 21, 2011 at 8:31 PM, Aman Goyal wrote:
>>
>>> @ankit gupta: superb solutn
>>>
>>>
>>> On Thu, Jul 21, 2011 at 8:09 PM, SkRiPt KiDdIe 
>>> wrote:
>>>
>>>> To get complete 32 bit inverse :
>>>>
>>>> x=((x>>1)&0x) | ((x<<1)&0x);
>>>> x=((x>>2)&0x) | ((x<<2)&0x);
>>>> x=((x>>4)&0x0F0F0F0F) | ((x<<4)&0xF0F0F0F0);
>>>> x=((x>>8)&0x00FF00FF) | ((x<<8)&0xFF00FF00);
>>>> x=((x>>16)&0x) | ((x<<16)&0x);
>>>>
>>>>  --
>>>> 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.
>>>
>>
>>
>>
>> --
>> Aditi Garg
>> Undergraduate Student
>> Electronics & Communication Divison
>> NETAJI SUBHAS INSTITUTE OF TECHNOLOGY
>> Sector 3, Dwarka
>> New Delhi
>>
>> 9718388816
>>
>>
>
>
> --
> Aditi Garg
> Undergraduate Student
> Electronics & Communication Divison
> NETAJI SUBHAS INSTITUTE OF TECHNOLOGY
> Sector 3, Dwarka
> New Delhi
>
> 9718388816
>
>  --
> 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.
>



-- 
Archita Monga

-- 
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: amazon

2011-07-19 Thread archita monga
Take 2 node pointers.Move one at the speed of twice the
other(first:node->next,second:node->next->next) when the first pointer
reaches the end of the list,the second will give you the middle node.

On Tue, Jul 19, 2011 at 3:27 PM, shilpa gupta wrote:

> give your algo.
>
>
> On Tue, Jul 19, 2011 at 3:26 PM, SAMMM  wrote:
>
>> O(n) is possible . Will it serve the purpose or need less than 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.
>>
>>
>
>
> --
> Shilpa Gupta
>
> B.Tech. 3rd year
> Computer Science and Engineering
> MNNIT 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.
>



-- 
Archita Monga

-- 
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] Puzzle[Google] Can be Solved programatically as well

2011-07-19 Thread archita monga
yaa..

On Tue, Jul 19, 2011 at 1:35 PM, alagammai narayanan
wrote:

> Yep.. Its German.. Were you guys able to come up with the 5 * 5 matrix...
> As in who lives in which house?What does he drink,smoke etc..
>
>
> On Tue, Jul 19, 2011 at 1:31 PM, archita monga wrote:
>
>> German!
>>
>>
>> On Tue, Jul 19, 2011 at 1:22 PM, D!leep Gupta 
>> wrote:
>>
>>> Ans. *German*
>>>
>>> --
>>> 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.
>>>
>>
>>
>>
>> --
>> Archita Monga
>>
>>  --
>> 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.
>



-- 
Archita Monga

-- 
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] Puzzle[Google] Can be Solved programatically as well

2011-07-19 Thread archita monga
German!

On Tue, Jul 19, 2011 at 1:22 PM, D!leep Gupta wrote:

> Ans. *German*
>
> --
> 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.
>



-- 
Archita Monga

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

2011-07-17 Thread archita monga
@manish-can u plz give more details about the Big Int class ques??what
exactly was d ques?

On Sun, Jul 17, 2011 at 5:38 PM, sourabh jakhar wrote:

> when we have + and - than we can also implement division as we do in
> assembly language
> subtract the divisor form dividend and keep track of remainder
>
>
> On Sun, Jul 17, 2011 at 5:34 PM, Piyush Sinha wrote:
>
>> @AnchalI think + -  and * wont create much problemwe have to think
>> for an efficient way for division
>>
>>
>>
>>
>>
>> --
>> *Piyush Sinha*
>> *IIIT, Allahabad*
>> *+91-7483122727*
>> * <https://www.facebook.com/profile.php?id=10655377926> "NEVER SAY
>> NEVER"
>> *
>>
>>  --
>> 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)(Final 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.
>



-- 
Archita Monga

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