Josephus Problem general case

[KunalKartik02]

Detailed description

I am proposing C++ implementation of the famous Josephus problem. The statement is as follows - Consider a game where there are n children (numbered 1,2,…,n) in a circle. During the game, every second child is removed from the circle, until there are no children left. In which order will the children be removed?

Context

This is a very famous and standard problem in the world of competitive programming. This would help improve the mathematical and implementation skills of the programmer and enhance his/her thinking capabilities. It would help the programmer understand more of C++'s STL components. It would also come in handy in many coding rounds of various companies.

Possible implementation

I am implementing it in C++. Data structure of set is being used to make searching easier and faster.

Additional information

Kindly assign this issue to KunalKartik02 and kindly review my https://github.com/TheAlgorithms/C-Plus-Plus/pull/2197

[KunalKartik02]

kindly review my https://github.com/TheAlgorithms/C-Plus-Plus/pull/2197

[KunalKartik02]

PR*

[Sakshi2002-Sinha]

Hello, Can you please assign this issue to me? Thanks in advance :)

[Avdhesh-Varshney]

Hello, I would like to work on this issue. Can you please assign it to me?

[github-actions[bot]]

This issue has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions[bot]]

Please ping one of the maintainers once you add more information and updates here. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!