A jail has N prisoners, and each prisoner has a unique id number, S, ranging from 1 to N. There are M sweets that must be distributed to the prisoners

Image
In this article, we will discuss about problem - A jail has N prisoners, and each prisoner has a unique id number, S, ranging from 1 to N. There are M sweets that must be distributed to the prisoners. The jailer decides the fairest way to do this is by sitting the prisoners down in a circle (ordered by ascending S), and then, starting with some random S, distribute one candy at a time to each sequentially numbered prisoner until all M candies are distributed. For example, if the jailer picks prisoner S = 2, then his distribution order would be (2, 3, 4, 5,..., n-1, n, 1, 2, 3, 4,...) until all M sweets are distributed. But wait —there's a catch—the very last sweet is poisoned! Can you find and print the ID number of the last prisoner to receive a sweet so he can be warned?

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