Recent searches
Search options
Given a list of schedules, where each schedule is a sorted sequence of non-overlapping intervals, return the list of finite intervals that are not covered by any of the intervals.
The intervals are half-open: {10, 15} covers 10 but not 15.
As an additional (C++ specific) challenge, avoid unnecessary copies of the input data.
Solve it yourself: https://compiler-explorer.com/z/3zj4M4hW7
Solution: https://compiler-explorer.com/z/E8ra7bPzf
@simontoth i was solving this problem in CTRE to check for first-follow conflict and if there is none, I can modify greedy cycle into possessive.
@hanadusikova Interesting; I would not expect this in particular to pop up in regular expressions.