Flea's Fastest Escape on 3D Box

This quant interview puzzle is about geometric optimization on a three-dimensional box surface under a speed constraint. Instead of moving through space, motion is restricted to the outer faces, turning a seemingly simple distance question into a subtle surface geometry problem that hides a non-obvious shortest route.

It trains spatial reasoning, mathematical modeling, and comfort with translating a real-world story into a clean optimization setup. In quant prep terms, it checks how well you handle geometric intuition, compare competing candidate solutions, and keep track of constraints like speed and distance simultaneously.

This matters for quant interviews because front-office roles at top trading firms need people who can spot structure in unusual settings, reduce dimensionality intelligently, and reason precisely under constraints. Problems like this separate candidates who memorize formulas from those who can genuinely think like quants.

What it tests

When seeking the shortest path between two points on the surface of a polyhedron, the key is to 'unfold' or 'develop' the surfaces into a plane so that the path becomes a straight line in two dimensions. This works because the shortest path on a flat surface is always a straight line, and by flattening the relevant faces, you preserve the distances and connectivity of the original 3D structure. The trick is to consider all possible unfoldings that connect the start and end points, as each unfolding corresponds to a different path across the box's faces. The minimum among these straight-line distances gives the true shortest path, which may not be the naive 3D diagonal or a path that only follows the box's edges.