Challenge
Challenge
Problem
Solutions
Submissions
Challenge Points: 10
Level: EasyThere are n friends sitting in a circle, numbered from 1 to n.
The game works like this:
The 1st friend starts with the ball.
On the 1st move, the ball is passed k steps clockwise.
On the 2nd move, the ball is passed 2 * k steps clockwise.
On the 3rd move, it is passed 3 * k steps clockwise, and so on.
The game stops when any friend receives the ball for the second time.
Your task is to return a list of all friends who never received the ball, sorted in increasing order.
Input: n = 6, k = 1
Output: [4,5,6]
Explanation:
Friends 1, 2, and 3 get the ball before 1 gets it again. Others never receive it.
Input: n = 7, k = 3
Output: [2,5,6,7]
Explanation:
Only friends 1, 4, and 3 got the ball before repetition occurred.
Accepted:
Submission:
Report an issue
Code
You need toto run or submitYou need toto run or submit
Test Case
Test Result