[algogeeks] MS-IT

2011-09-21 Thread ankit arun
hi!! MS-IT is visiting our college. could anyone plz help me in knowing what kind of questions(interview) they asked/asking. Thanks in advance. Ankit Arun NIT Durgapur -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To

[algogeeks] Re: SEEK advice very urgent

2011-09-01 Thread ankit arun
@ raj which clg r u from? I would say btr to choose its branch in Singapore. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/eUlkIYwpzTgJ. To post to this

Re: [algogeeks] Re: Suggestion

2011-08-26 Thread ankit arun
Ya sure... :) After posting it Igot even more confused... On Sat, Aug 27, 2011 at 9:33 AM, siddharth srivastava wrote: > > > On 27 August 2011 08:48, ankit arun wrote: > >> thanks everybody for so many suggestions... :) > > > > so let us know when you finish al

Re: [algogeeks] Re: Suggestion

2011-08-26 Thread ankit arun
>> "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 > >&

[algogeeks] Suggestion

2011-08-25 Thread ankit arun
Plz suggest me a good book for "Data structure in C." -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/q93wVIu_W9IJ. To post to this group, send email to alg

[algogeeks] Re: Some adobe interview questions.

2011-07-05 Thread ankit arun
no 7000 is not possible because, '7' is also there so you have to mention at the index of '7' that it is there 1 time.. On Jul 6, 12:32 am, aditya kumar wrote: > in 7000 : '0' occurs seven times and rst of the numbers occur zero > times. i still dint get where i am wrong . plz explain me

[algogeeks] Re: MS Interview

2011-06-09 Thread ankit arun
part 1 can be solved in O(1) complexity.. first adding all the numbers and then subtracting it from 4,000,000,000 will give the result. On Jun 9, 2:45 pm, Dumanshu wrote: > Q1. I  have a file in which there are supposed to be 4 billion > numbers, > starting from 1 to 4,000,000,000 but unfortunate

Re: [algogeeks] Digest for algogeeks@googlegroups.com - 25 Messages in 7 Topics

2011-06-09 Thread ankit arun
0 > ^<#130742ba4deca0ba_digest_top> > >Hi Moderators, >Can you please Ban Sohail from algogeeks? >We are receiving a lot of spams from him. >sohail.panz...@gmail.com > >-- >Cheers >Naveen Kumar > > > > Topic: Regular Exp