Leetcode 1823. Find the Winner of the Circular Game

Given n people seated in a circle, repeatedly remove every k-th person clockwise until one remains and return their label — the classic Josephus problem. It can be solved efficiently using the Josephus recurrence to compute the last remaining index in O(n) time and O(1) space.