Minimum Board Length for Holes

Question

An old table has n holes in its surface, and the integer array arr lists where each hole sits. Every hole must end up under one of exactly two boards. Both boards are cut to one shared length, a positive integer. When a board of length L has its left end at X, its reach is [X, X + L]: holes at X, at X + L and anywhere between are hidden. ...