Problem 1621 · Medium

Number of Sets of K Non-Overlapping Line Segments

Each segment uses two of the n + k - 1 slots, so the count is a binomial coefficient built with Pascal’s triangle.

Open the interactive visualisation