Problem 646 · Medium

Maximum Length of Pair Chain

Find the largest number of pairs that can be chained so each pair starts after the previous one ends. The visual sorts the pairs by end point and greedily picks the next compatible pair.

Open the interactive visualisation