Josephus problem using python
>> YOUR LINK HERE: ___ http://youtube.com/watch?v=DBHHW-qUVrE
Question: A group of n prisoners stand in a circle awaiting execution. Starting from an arbitrary position(0), the executioner kills every kth person until one person remains standing, who is then granted freedom (see examples). • Create a function that takes 2 arguments — the number of people to be execute n, and the step size k, and returns the original position (index) of the person who survives. • To Start solving the puzzles which are frequently asked in interview Python from Udemy... • https://www.udemy.com/course/python-b...
#############################
