New course! Every coder should learn Generative AI!
Try a free lesson0
You can solve the Josephus' problem with a circular linked list, see the link attached.
Basically, every "player" is a list node and "skipping" one node (breaking and reconnecting the "->next" link) means playing one turn.
https://www.geeksforgeeks.org/josephus-circle-using-circular-linked-list/
Often have questions like this?
Learn more efficiently, for free:
Hot today
Bash
0 Votes
Why exception is not handled
1 Votes
Links of cmy codes
5 Votes
Please help
0 Votes
Link
6 Votes