NeetCode #932LC-1823MediumMath & Geometry
← Back to All Problems#932 · #1823 · Find the Winner of the Circular Game(找出游戏的获胜者)
📌 Problem Statement & Constraints
n friends numbered 1..n stand in a circle. Counting starts at friend 1; every k-th friend is eliminated and counting resumes from the next friend. Return the number of the last remaining friend. Constraints: 1 <= k <= n <= 500.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!