I'm looking for an algorithm to solve the following:
I have n (open) intervals (ai, bi) 1 <= i <= n.
How can you find an interval that is contained in the most given intervals?
E.g I1 = (1, 10), I2 = (2, 9), I3 = (4, 20), I4 = (8, 12), I5 = (12, 13).
In this case (8, 9) is contained in 4 of the 5 intervals.
I'm not sure if it's as simple as it sounds, any ideas?