How do I solve the Interval Covering Problem from ZCO 2015??? asked 03 Jan '15, 21:55

First sort the input sets according to their starting points. Now start considering 2 sets at a time, in the beginning the 1st and 2nd set. There are 3 cases which will come up. Think about how you should approach each of these conditions. answered 04 Jan '15, 00:22
@arpanb8 You got the algorithm? If anybody needs help beyond this they can ask.
(04 Jan '15, 23:26)
TNXX @OrganicShilling
(05 Jan '15, 19:53)
But @OrganicShilling isn't the worst case complexity O(N^2)? How does it get solved linearly? Although, O(N^2) is enough for this problem...
(05 Jan '15, 20:28)
yep...that is a q. that struck me 2...But n2 is enough for this prob...
(05 Jan '15, 20:29)
