Ram's Puzzles

(Challenge #1)

You are working in a Diamond Factory. You are responsible for collecting all the designs of diamonds which are mainly made for girl's ornaments. you always get diamonds as pairs. but recent few days your organisation is facing heavy problems because while making pairs, one of pair is not a pair. so at the end of each day, you find only one of the diamond and not a pair.The Numbers of Diamond coming into your organisation is not a constant number, it varies and also the order of the diamonds is also not sequentials it might be sent at any time and any sequence.but at the end of day, if you verify all the diamonds, there will be one diamond left without a pair

you are asked to write an efficient algorithm to find that single diamond ?

\\ Ram ...challenges will continue if u ans this :-)