Gamified challenge · XOR tricks
Tickets numbered 0, 1, …, n were handed out, all different. tickets holds the n that came back, in any order, so exactly one number from 0..n is missing (n is the length of tickets).
Write missing(tickets) that returns the missing ticket number. For [3, 0, 1], n = 3, the numbers are 0..3, and the answer is 2. An empty list means the only ticket, 0, is missing.
Aim for one pass and O(1) extra memory: XOR or a running sum both work.
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