Given the total number of persons n and a number k which indicates that k-1 persons are skipped and kth person is killed in circle in a fixed direction.
The task is to choose the safe place in the circle so that when you perform these operations starting from 1st place in the circle, you are the last one remaining and survive.
Input: n = 3 k = 2 Output: 3 Explanation: There are 3 persons so skipping 1 person i.e 1st person 2nd person will be killed. Thus the safe position is 3.
Input: n = 5 k = 3 Output: 4 Explanation: There are 5 persons so skipping 2 person i.e 3rd person will be killed. Thus the safe position is 4.
You don't need to read input or print anything. You are required to complete the function josephus () that takes two parameters n and k and returns an integer denoting safe position.
Expected Time Complexity: O(N).
Expected Auxiliary Space: O(N).
1 <= k, n <= 20
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes