Survive the Josephus Circle
Best place to stand in circle is a hard quant interview question on Brain Teasers, reported to have been seen at Belvedere Trading.
MyQuantPartner is not affiliated with, endorsed by, or sponsored by these companies, and all trademarks belong to their respective owners.
This brain teaser is about survival in a structured elimination game that loops around a circle in a perfectly regular way. Even though the story is dramatic, the real core is a discrete pattern hiding underneath repeated, deterministic removals. It's a classic theoretical puzzle often used in quant prep to see whether candidates can strip away narrative and focus on the underlying mathematical structure driving the outcome.
It trains your ability to recognize and exploit patterns in iterative processes, especially ones with self-similarity and wrap-around effects. Working through it sharpens your intuition for sequences, binary structure, and recurrence, as well as your comfort with generalizing from small toy examples to a large systematic rule. It also develops the habit of translating a story problem into a compact mathematical description.
This matters for quant interviews because many systematic trading and risk problems have the same flavor: a simple local rule, repeated many times, produces non-obvious global behavior. Interviewers want to see that you can uncover hidden structure in processes, reason about large systems efficiently, and move from simulation or brute force thinking to a closed-form understanding, which is crucial for designing and analyzing quantitative models.
What it tests
This class of problems is governed by the structure of binary elimination cycles, where each round removes every second participant in a fixed order. The key is that the process is periodic and wraps around, so the survivor's position is determined by how many complete cycles (powers of 2) can be performed before the process resets. The underlying pattern is that after each full cycle, the problem reduces to a smaller, self-similar instance, with the survivor's position shifting predictably. The binary representation of the total count encodes this structure: removing the highest power of 2 and doubling the remainder, then adding one, gives the survivor's position. This works because the elimination pattern effectively rotates the list, and the survivor's index tracks how far past the last full power-of-2 cycle you are.
Practise this question with written feedback, or hear it in a spoken mock interview.
Get started free