You're
 given 
an
 unsorted
 array 
of
 integers
 where
 every 
integer 
appears
 exactly
 twice, 
except 
for 
one 
integer
 which
 appears
 only 
once.

 Write
 an 
algorithm
 
that 
finds
 the
 integer
 that
 appears 
only 
once.

Image
You're
 given 
an
 unsorted
 array 
of
 integers
 where
 every 
integer 
appears
 exactly
 twice, 
except 
for 
one 
integer
 which
 appears
 only 
once.

 Write
 an 
algorithm
 
that 
finds
 the
 integer
 that
 appears 
only 
once. In this article we will understand the logic and approach to finds
 the
 integer
 that
 appears 
only 
once. This is one of the most popular question asked in Google interviews.

Navigation

Social Media