LeetCodeFind the Winner of the Circular Game
Recursion
Asked at 12 companies
6 recent
- opentext
- Goldman Sachs
- Bloomberg
- Microsoft
- Amazon
- Meta
- Nutanix
- Accenture
- Oracle
- Adobe
+2 moreShow fewer
- Zoho
- tcs
Community-reported · source · updated 2026-10-08. ● asked in the last 6 months.
Go step by step: try it yourself before the video and the visual. Progress saves on this device.
0 / 130 pointsSolved (Medium) 0/40Reviews 0/50Mastered 0/25Practice steps 0/15
Step 1
Know these before you start
Practise each one here, or tick what you already know
Concept videoStep 2
Try it on paper
5–10 minutes, no code yet
In the wild · Folders and JSON: Finding every file in a folder means listing the folder and doing the same for each folder inside it. Code that reads nested JSON walks it the same way.
About this problem
Solve a problem with a smaller copy of itself: a base case, one step, and trust the call.
Read the full statement and examples on LeetCode, try it for 20–30 minutes, then come back for the walkthrough.
Examples
Full statement on LeetCode ↗Example 1
- Input
- n = 5k = 2
- Output
- 3
Example 2
- Input
- n = 6k = 5
- Output
- 1
Example 3
- Input
- n = 1k = 1
- Output
- 1
Code it here
Tab indents · ⌘/Ctrl+Enter runs · Esc leaves the editor
Step 6
Get it accepted
All test cases pass
Step 7
Review it so it sticks
Re-solve from memory after
The step that matters most: without reviews most of a solved problem fades within weeks. Three short re-solves, each just as you start to forget, are what make it yours.
Your notes
Three lines in your own words. They come back with this problem's reviews, so you can check yourself after recalling the solution.
Solve it yourself before you look
Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.
Hidden: optimal solution
Solution code
Optimal solutionThis is the Josephus problem. With friends numbered from 0, the winner among n is (winner among n − 1 + k) mod n, and with one friend it's 0. Build that up from 1 to n and add 1 at the end.
class Solution:
def findTheWinner(self, n: int, k: int) -> int:
winner = 0 # 0-indexed winner with 1 friend
for size in range(2, n + 1):
winner = (winner + k) % size
return winner + 1Reference solution, tested in Python, Java and C++.
Other ways to solve it
- Thought of another approach (slower, or cleverer)? Code it here: the same tests check any approach.
- Community solutions on LeetCode ↗ for many more versions, in many languages. Read them after you've solved it.