circularGameLosers: easy O(n) solution. ✅
IntuitionThe problem requires identifying players who lose in a circular game. By keeping track of which friends have been chosen in each round, we can determin
# Intuition
The problem requires identifying players who lose in a circular game. By keeping track of which friends have been chosen in each round, we can determine which friends are not chosen by the end of the game.

# Approach
1. Initialize an array to keep track of which friends have been chosen.
2. Use a loop to simulate the game, updating the chosen friend's status in each round.
3. Calculate the next friend to be chosen based on the current index and step size (k).
4. Continue the loop until a friend is chosen twice, indicating the end of the game.
5. Iterate through the array to identify friends who were not chosen and add them to the result list.

# Complexity
- Time complexity:
O(n)

- Space complexity:
O(n)

# Code
```python3 []
class Solution:
    def circularGameLosers(self, n: int, k: int) -> List[int]:
        friends=[False]*n
        i=k
        temp=0
        while(friends[temp]==False):
            friends[temp]=True
            temp=(temp+i)%n
            i+=k  
        answer=[]
        for i in range(n):
            if friends[i]==False:
                answer.append(i+1)
        return answer
        
```
['Array', 'Hash Table', 'Simulation', 'Python3']