Equal-Sum Clock Fragments
Dividing clock numbers into equal sums is a medium quant interview question on Brain Teasers.
This teaser considers a standard clock face, with its numbers arranged around a circle, being broken into several contiguous pieces. The twist is that, when the fragments are examined, each piece contains numbers that add up to the same total, and the fragments themselves must respect the natural circular adjacency of the clock. The candidate has to reason about how to cut the circle into arcs that all have the same sum, and to identify which numbers must sit together on each fragment. Because the layout is circular, the "ends" of the sequence also touch, so you cannot treat the numbers as lying on a straight line.
Solving it leans on careful use of total sums, divisibility, and the structure of contiguous segments on a cycle. Useful techniques include turning the circular arrangement into a linear one with wraparound, tracking partial sums, and ruling out impossible partitions by parity or bounding arguments. Interviewers watch for systematic case reduction instead of brute-force search, clear justification of why certain groupings cannot work, and the ability to exploit symmetry and invariants in a simple-looking but constrained combinatorial setting.
What it tests
When partitioning objects arranged in a circle (such as numbers on a clock) into groups with equal sums, the key structure is the cyclical adjacency: the sequence wraps around, so the first and last elements are neighbors. This means that any contiguous segment can start at any point and continue around the circle, and the sum of such segments can be compared directly. The constraint of equal sums forces you to consider how the total divides, and the cyclical structure often allows for symmetric or paired groupings that would not be possible in a linear arrangement. The principle holds because the circle's topology means every partition must respect both the sum and the adjacency, leading to unique or highly constrained solutions. This approach generalizes to any problem where objects are arranged in a cycle and must be split into contiguous groups with equal properties.
Practise this question with written feedback, or hear it in a spoken mock interview.
Get started free