8 August "Problem of the Day" Answer

                                                                   GeeksforGeeks
                                                           
The Question is :- "Josephus problem"
Answer :- the solution is given below

class Solution
{
    public:
    int josephus(int n, int k)
    {
       if(n==1) return 1;
        
        return (josephus(n-1, k) + k-1) % n+1;
    }
};


Hope you understand the answer, and complete it.
Stay Connected for daily Problem of the Day answers.

Thank you All!