Broken Clock Equal-Sum Puzzle

This puzzle describes a broken analogue clock face whose numbered sections end up split into three fragments, each fragment carrying different numbers but sharing the same total. The candidate must reason about how the numbers around a clock can be grouped when the circular dial is physically fractured into pieces. The twist is that the groups are not abstract sets: they have to correspond to contiguous regions that could realistically appear on shattered clock segments, which makes the problem more than a simple arithmetic partitioning exercise.

Solving it leans on subset-sum thinking, modular structure of the clock's numbering, and spatial or geometric reasoning on a circle. A strong answer will quickly establish the total and implied target sum per piece, but then shift from pure combinatorics to feasibility: which clusters of adjacent numbers could belong to one shard, and how many pieces those shards might contain. Interviewers look for candidates who systematically prune impossible groupings, question hidden assumptions about fragment shape, and clearly explain why the final configuration is unique or constrained rather than just accidentally satisfying the sum.

What it tests

This problem class is governed by the principle of partitioning a set of labeled objects (here, the numbers 1 to 12) into subsets with equal sums, subject to geometric or spatial constraints. The key is that the sum constraint interacts with the arrangement constraint: not every partition that satisfies the sum will be spatially possible, and not every spatial grouping will satisfy the sum. The underlying pattern is to first determine the target subset sum by dividing the total by the number of groups, and then to search for groupings that both achieve this sum and respect any imposed spatial or structural rules. The difficulty often lies in the tension between arithmetic feasibility and geometric possibility, which forces you to consider non-obvious groupings or to relax assumptions about shape or contiguity. This principle holds because the sum constraint is absolute, but the spatial constraint may be flexible or counterintuitive.