You are given a sequence of intervals, as tuples of ints where the tuples are sorted by
their first element in ascending order.
It is your task to minimize the number of intervals by merging those that intersect or by removing intervals fitting into another one.
Since the range of values for the intervals is restricted to integers, you must also merge those intervals between which no value can be found.
Let's say you've got these 5 intervals: 1..6, 3..5, 7..10, 9..12 and 14..16 .
1..6 and 3..5
3..5 fits into 1..6 , so 3..5 must disappear.
1..6 and 7..10
Even though the intervals do not intersect, there can not be a value of type int between them, so they have to be merged to the new interval 1..10 .
These intervals do intersect, because
- No Ads
- No Limits
- More Content
CheckiO Extensions allow you to use local files to solve missions. More info in a blog post.
In order to install CheckiO client you'll need installed Python (version at least 3.8)
Install CheckiO Client first:
pip3 install checkio_client
Configure your tool
checkio --domain=py config --key=
Sync solutions into your local folder
(in beta testing) Launch local server so your browser can use it and sync solution between local file end extension on the fly. (doesn't work for safari)
checkio serv -d
Alternatevly, you can install Chrome extension or FF addon
checkio install-plugin --ff
checkio install-plugin --chromium