Optimal first-drop spacing: k+(k-1)+... >= n → O(sqrt n).
Confirm constraints before coding. State complexity up front.
Practice with Linkjob AI.