Given $n$ processes arranged in a circle, starting from a given position and skipping $k$ processes at each step, find the position of the last remaining process (Josephus Problem).
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.