/* A possible source of useful stuff:
import java.util.Collections;
*/

import java.util.List;

/** HW #8, Problem 2.
 *  @author
  */
class Ranges {
    /** Assuming that RANGES contains two-element arrays of integers,
     *  <x,y> with x <= y, representing intervals of ints, this returns
     *  a List of the intervals of [0 .. MAX] that are NOT covered by one of
     *  the intervals in RANGES. The resulting list consists of
     *  non-overlapping intervals ordered in increasing order of
     *  their starting points. */
    static List<int[]> uncovered(List<int[]> ranges, int max) {
        // REPLACE WITH APPROPRIATE STATEMENTS
        return null;
    }

}