The challenge is to find the minimal set of intervals without creating gaps.
There is a table with groups of redundantly overlapping date intervals where each group has no gaps. Given this table, your job is to find the minimum set of date intervals without creating gaps in the group. A solution is defined such that if you remove any one of the intervals in the solution you will create a gap. The first and last date intervals in a group are considered the anchor intervals and must always be present.
If there are multiple solutions for a group you must choose the one where the number of date intervals is a minimum.
If there are still multiple solutions for a group you must choose the one where the sum of the date intervals is a minimum.
If there are still multiple solutions for a group you must choose the one based on an order by start date 1, start date 2,
etc of the solutions, where 'start date 1' is the lowest start date value of each solution, 'start date 2' is the next lowest
start date value of each solution, etc.