Remove the Point at a Given Index from the Flattened Sequence of Covered Integers
Given a list of non-overlapping half-open intervals [start, end), where each interval covers the integers start, start+1, ..., end-1, and a 0-based index idx, find and remove the integer point at position idx in the flattened sequence of all integers covered by the intervals (ordered according to the input intervals). Return the resulting list of intervals after the removal.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Late August, 2026
You are given a list of non-overlapping intervals, where each interval [start, end] represents a range of integers from start (inclusive) to end (exclusive). For example, the interval [10, 13] covers the integers 10, 11, and 12. These intervals collectively cover a sequence of integer points. You are also given an integer idx, which refers to the index (0-based) of a point you need to remove, in the flattened sequence of all covered integers ordered according to the input intervals.
Hello Interview Premium
Your account is free and you can post anonymously if you choose.