About this question
Medium · Game Theory & Logic · Quant Trader interview question · game-theory, logic, strategy
A circular pizza is cut into $n\geq1$ equally sized slices. Your opponent takes the first slice. You then alternate turns, taking exactly one slice per turn, until no slices remain. Every slice taken after the first must be adjacent to the connected region of slices already removed, so each turn consists of choosing one of the two boundary slices that remain. You are the second player. What is the minimum integer $n$ for which you are guaranteed to receive at least 50% of the pizza?