Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Find the Winner of the Circular Game
Coding · Array · Math · Queue
- Find Circular Gift Exchange Chains
Coding
- Find if Digit Game Can Be Won
Coding
- Find the K-th Character in String Game I
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2682. Find the Losers of the Circular Game
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source