There are N Children are seated on N chairs arranged around a circle. The chairs are numbered from 1 to N. The game starts going in circles counting the children starting with the first chair. Once the count reaches K, that child leaves the game, removing his/her chair. The game starts again, beginning with the next chair in the circle. The last child remaining in the circle is the winner. Find the child that wins the game.
Input : N = 5, K = 2 Output : 3 Firstly, the child at position 2 is out, then position 4 goes out, then position 1 Finally, the child at position 5 is out. So the position 3 survives. Input : 7 4 Output : 2
We have discussed a recursive solution for Josephus Problem . The given solution is better than the recursive solution of Josephus Solution which is not suitable for large inputs as it gives stack overflow. The time complexity is O(N).
Approach – In the algorithm, we use sum variable to find out the chair to be removed. The current chair position is calculated by adding the chair count K to the previous position i.e. sum and modulus of the sum. At last we return sum+1 as numbering starts from 1 to N.
- Find four elements that sum to a given value | Set 1 (n^3 solution)
- Eggs dropping puzzle (Binomial Coefficient and Binary Search Solution)
- QuickSelect (A Simple Iterative Implementation)
- C Program for Binary Search (Recursive and Iterative)
- Largest number less than or equal to N in BST (Iterative Approach)
- Pizza Problem
- The painter's partition problem
- The painter's partition problem | Set 2
- A Problem in Many Binary Search Implementations
- Card Shuffle Problem | TCS Digital Advanced Coding Question
- Queries for elements greater than K in the given index range using Segment Tree
- Calculate the Sum of GCD over all subarrays
- Find the player who will win the Coin game
- Optimal Strategy for a Game | Special Gold Coin
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.