Find the Losers of the Circular Game.py

'''
There are n friends that are playing a game. The friends are sitting in a circle and are numbered from 1 to n in clockwise order. More formally, moving clockwise from the ith friend brings you to the (i+1)th friend for 1 <= i < n, and moving clockwise from the nth friend brings you to the 1st friend.

The rules of the game are as follows:

1st friend receives the ball.

After that, 1st friend passes it to the friend who is k steps away from them in the clockwise direction.
After that, the friend who receives the ball should pass it to the friend who is 2 * k steps away from them in the clockwise direction.
After that, the friend who receives the ball should pass it to the friend who is 3 * k steps away from them in the clockwise direction, and so on and so forth.
In other words, on the ith turn, the friend holding the ball should pass it to the friend who is i * k steps away from them in the clockwise direction.

The game is finished when some friend receives the ball for the second time.

The losers of the game are friends who did not receive the ball in the entire game.

Given the number of friends, n, and an integer k, return the array answer, which contains the losers of the game in the ascending order.
'''

class Solution:
    def circularGameLosers(self, n: int, k: int) -> List[int]:

        ans = [0]
        m = k
        while True:
            if (ans[-1]+m)%n not in ans:
                ans.append((ans[-1]+m)%n)
                m= m+k
            else:
                break
        
        res = [(i+1) for i in range(n) if i not in ans]
        print(res)
        return res
    
----------------------------------------------------------------------------------------------------------------------------------------------------------    
class Solution:
    def circularGameLosers(self, n: int, k: int) -> List[int]:
        start = 0
        sset = set()
        p = 1
        while start not in sset:
            sset.add(start)
            start += p*k
            start = start%n
            p += 1
        ans = []
        for i in range(n):
            if i not in sset:
                ans.append(i+1)
        return ans