Leetcode 2682. Find the Losers of the Circular Game
Starting from friend 1, repeatedly advance i*k positions clockwise (mod n) on the i-th move, track visited friends until some friend is visited twice, and return the ascending list of friends who were never visited.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.