How should I practice Josephus Elimination Until Half Remain?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Bloomberg LP phone screen problems in FastPrep.

Is Josephus Elimination Until Half Remain associated with Bloomberg LP?

FastPrep tags this as a Bloomberg LP phone screen coding practice problem when the problem catalog has that company and stage context.

Josephus Elimination Until Half Remain

Bloomberg LP● MediumNEW GRADPHONE SCREEN

Learn

Problem statement

People labeled 1 through n stand clockwise. The current person initially is 1. Advance k positions clockwise, not counting the current person; remove the person landed on. Resume from the next survivor.

Return removals in order, stopping when ceil(n/2) people remain.

Function

eliminateUntilHalf(n: int, k: int) → int[]

Examples

Example 1

n = 6k = 4return = [5,4,6]

Exclusive counting from 1 lands on 5; continue until three survivors remain.

Constraints

1 <= n <= 10^4.
0 <= k <= 10^9.