## Interview Question

Country: China
Interview Type: Phone Interview

Comment hidden because of low score. Click to expand.
0
of 0 vote

[ geeksforgeeks.org/josephus-problem-set-1-a-on-solution/ ]

Comment hidden because of low score. Click to expand.
0
of 0 vote

``````#include<iostream>
using namespace std;

int josephus(int n, int k)
{
if (n == 1)
{
return 1;
}
else
{
// The position returned by josephus(n - 1, k) is adjusted because the recursive call
// josephus(n - 1, k) considers the original position (k%n + 1) as position 1
return (josephus(n-1, k) + k-1) % n + 1;
}
}

int main()
{
int n;
int k;
cout << "Number of people in circle :";
cin >> n;
cout << "Number of people to skip :";
cin >> k;
cout << "Safe place to stand is :" << josephus(n, k) << endl;
return 0;
}``````

Comment hidden because of low score. Click to expand.
0
of 0 vote

``````#include<iostream>
using namespace std;

int josephus(int n, int k)
{
if (n == 1)
{
return 1;
}
else
{
// The position returned by josephus(n - 1, k) is adjusted because the recursive call
// josephus(n - 1, k) considers the original position (k%n + 1) as position 1
return (josephus(n-1, k) + k-1) % n + 1;
}
}

int main()
{
int n;
int k;
cout << "Number of people in circle :";
cin >> n;
cout << "Number of people to skip :";
cin >> k;
cout << "Safe place to stand is :" << josephus(n, k) << endl;
return 0;``````

}

Comment hidden because of low score. Click to expand.
0

it prints the last man alive.
The problem is to calculate the last two men alive.

Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

### Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

### Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.