DEV Community

Cover image for 1823. Find the Winner of the Circular Game
MD ARIFUL HAQUE
MD ARIFUL HAQUE

Posted on • Edited on

1

1823. Find the Winner of the Circular Game

1823. Find the Winner of the Circular Game

Medium

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:

  1. Start at the 1st friend.
  2. Count the next k friends in the clockwise direction including the friend you started at. The counting wraps around the circle and may count some friends more than once.
  3. The last friend you counted leaves the circle and loses the game.
  4. If there is still more than one friend in the circle, go back to step 2 starting from the friend immediately clockwise of the friend who just lost and repeat.
  5. Else, the last friend in the circle wins the game.

Given the number of friends, n, and an integer k, return the winner of the game.

Example 1:

ic234-q2-ex11

  • Input: n = 5, k = 2
  • Output: 3
  • Explanation: Here are the steps of the game:
    1. Start at friend 1.
    2. Count 2 friends clockwise, which are friends 1 and 2.
    3. Friend 2 leaves the circle. Next start is friend 3.
    4. Count 2 friends clockwise, which are friends 3 and 4.
    5. Friend 4 leaves the circle. Next start is friend 5.
    6. Count 2 friends clockwise, which are friends 5 and 1.
    7. Friend 1 leaves the circle. Next start is friend 3.
    8. Count 2 friends clockwise, which are friends 3 and 5.
    9. Friend 5 leaves the circle. Only friend 3 is left, so they are the winner.

Example 2:

  • Input: n = 6, k = 5
  • Output: 1
  • Explanation: The friends leave in this order: 5, 4, 6, 2, 3. The winner is friend 1.

Constraints:

  • 1 <= k <= n <= 500

Follow up:

Could you solve this problem in linear time with constant space?

Solution:

class Solution {

    /**
     * @param Integer $n
     * @param Integer $k
     * @return Integer
     */
    function findTheWinner($n, $k) {
        $winner = 0;
        for ($i = 1; $i <= $n; $i++) {
            $winner = ($winner + $k) % $i;
        }
        return $winner + 1; // +1 because array index starts from 0
    }
}
Enter fullscreen mode Exit fullscreen mode

Contact Links

If you found this series helpful, please consider giving the repository a star on GitHub or sharing the post on your favorite social networks 😍. Your support would mean a lot to me!

If you want more helpful content like this, feel free to follow me:

Image of Datadog

How to Diagram Your Cloud Architecture

Cloud architecture diagrams provide critical visibility into the resources in your environment and how they’re connected. In our latest eBook, AWS Solution Architects Jason Mimick and James Wenzel walk through best practices on how to build effective and professional diagrams.

Download the Free eBook

Top comments (0)

Billboard image

The Next Generation Developer Platform

Coherence is the first Platform-as-a-Service you can control. Unlike "black-box" platforms that are opinionated about the infra you can deploy, Coherence is powered by CNC, the open-source IaC framework, which offers limitless customization.

Learn more