Remove Covered Point

You are given an array of non-overlapping intervals, where each interval [start, end) represents the integers from start up to but not including end. For instance, [10, 13) contains the points 10, 11, and 12. Together, these intervals define an ordered sequence of integer points. Additionally, you receive a 0-based integer index that points to a position in the flattened list of all covered integers, taken in the order of the input intervals. Your task is to delete the point…