Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Find the Winner of an Array Game
Coding · Array · Simulation
- Design Circular Queue
Coding · Array · Design · Linked List
- Add Binary
Coding · Bit Manipulation · Math · Simulation
- Add Two Numbers
Coding · Linked List · Math · Recursion
Sources · 2 references
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 1823. Find the Winner of the Circular Game
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Goldman Sachs
Find the Winner of the Circular Game
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 56.8. This is not an interview probability.
View source