Merge Intervals
You are given a sequence of intervals, as tuples of ints where the tuples are sorted by
their first element in ascending order.
It is your task to minimize the number of intervals by merging those that intersect or
by removing intervals fitting into another one.
Since the range of values for the intervals is restricted to integers, you must also merge those intervals between which no value can be found.
An example:
Let's say you've got these 5 intervals: 1..6, 3..5, 7..10, 9..12 and 14..16.

1..6 and 3..5
3..5 fits into 1..6, so 3..5 must disappear. 
1..6 and 7..10
Even though the intervals do not intersect, there can not be a value of type int between them, so they have to be merged to the new interval 1..10. 
1..10 and 9..12
These intervals do intersect, because 9 < 10, so they have to be merged to the new interval 1..12. 
...
These two intervals do not intersect, so they must not be merged.
You should be an authorized user in order to see the full description and start solving this mission.