[mithunfan]

Originally Posted by iwannabeac

http://gcc.gnu.org/

also, last i checked, google was up and running.

[sravu]

[gopipunjabi]

[ajrulez]

Originally Posted by pxs007

Easiest one I can think of : a simple hash. I will assume there are no duplicates in the number list (even if there was it would just mean a rehash ).

This is a problem posed in lotsa interviews. Anyone going to one should know this. Good one AJ.

Yes....thats an efficient solution Probably the most efficient one. They were looking for logic here rather than programing techniques...I mean I'm sure this answer wouldn't have ticked em off

[ajrulez]

Originally Posted by iwannabeac

umm ... assuming no dupes,

1. sum of all
2. find out how much is the difference of the sum from SUM(1...100).

shd give the missing.

OK?

That is exactly what they wanted to see actually They wanted entry level guys to think in this manner:

Sum of 1 to n = n (n+1) / 2
and then subtract...just what u said....bulls eye!

[ajrulez]

Duplicate...sorry

[ajrulez]

Another solution to the problem...not so efficient but one of the guys answered it this way:

Just deal with the list that is missing a number, sort it, and go thru the list subtracting every index [i] from index [i+1]..so when [i+1] - i > 1, u get the missing number

[loveguy]

Here is the code for checking whether a no. is prime or not

let n be the no.


int flag=0;
for ( i=2;i<=n/2;i++)
{
if ( n % i==0)
{
flag=1;
}
}
if (flag!=1)
cout<<"The no. is prime";
else
cout<<"The no. is not prime";

[iwannabeac]

Originally Posted by ajrulez

Another solution to the problem...not so efficient but one of the guys answered it this way:

Just deal with the list that is missing a number, sort it, and go thru the list subtracting every index [i] from index [i+1]..so when [i+1] - i > 1, u get the missing number

hmm ... interesting.

I like the hash solution best, btw

[shrek12345]

Wow..awesome Guys..nice to see that u kept the thread alive ...I too will keep on contributing ...but let me see what are u discussing.....................