In Python, not the best answer though, with a complexity of O(n)
def josephus_survivor(n, k): arr = list(range(1, n+1)) idx = 0 step = k - 1 while len(arr) > 1: idx = (idx + step) % len(arr) arr.pop(idx) return arr.pop()
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
In Python, not the best answer though, with a complexity of O(n)