Gamified challenge · Hash sets
tickets[i] is the number (1 or more) on the i-th ticket handed to the desk. Write firstDuplicate(tickets) that returns the ticket number whose second copy is handed in earliest, or -1 if no number appears twice.
For [2, 1, 3, 5, 3, 2] the answer is 3: both 2 and 3 come back, but the second 3 arrives at position 4, before the second 2 at position 5.
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google