Hangjin Zhang wrote:
Do an XOR on all numbers. The resulte is the number which occurs only once
HZ
On 12/30/06, Abhishek [EMAIL PROTECTED] wrote:
Hi,
Suppose I have a sequence of numbers in which every number occurs twice
in the sequence except one. Whats the fastest way of finding that
XOR is the best computationally as well as space complexity.
On 1/16/07, Satish [EMAIL PROTECTED] wrote:
Hangjin Zhang wrote:
Do an XOR on all numbers. The resulte is the number which occurs only
once
HZ
On 12/30/06, Abhishek [EMAIL PROTECTED] wrote:
Hi,
Suppose I have a
*
Here is How You Can Participate
* *Step 1* *Register for the Imagine Cup
*Click on the link
http://imaginecup.com/Registration/Default.aspx?ReferralCode=*IC07IN91*
somseckhttp://imaginecup.com/Registration/Default.aspx?ReferralCode=IC07IN91somseck
and register for the Imagine Cup in