4-liner: no title clear solution for Merge Intervals by przemyslaw.daniel - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

4-liner: no title solution in Clear category for Merge Intervals by przemyslaw.daniel

def merge_intervals(data):
    result = sorted(set(sum([list(range(x, y+1)) for x, y in data], [])))
    result = [x for x in result for k in [-1, 1] if x+k not in result]
    return list(zip(result[0::2], result[1::2]))

July 28, 2017

Comments:

juestr on April 23, 2019, 10:41 p.m.
Tricky and very inefficient for large numbers, should be in weird category.

przemyslaw.daniel on April 24, 2019, 5:53 a.m.
It is inefficient but easy to understand. Basically, we've got 3 LOC here - slice and flatten - determine boundaries - join together Example for merge_intervals([(2, 4), (1, 5), (7, 10)]) - [1, 2, 3, 4, 5, 7, 8, 9, 10] - [1, 5, 7, 10] - [(1, 5), (7, 10)] Efficiency is not the purpose in this category

juestr on April 24, 2019, 11:39 a.m.
I understood it perfectly well, and I would have voted for it in "creative". Let's agree to disagree about what's simple and educational. The most obvious solutions to this rather simple problem are all roughly O(n) in time and space, not O(x**n) (worst case) in time and space. And they aren't that much longer or harder to understand.

bsquare on Sept. 14, 2019, 11:44 p.m.
Nice (and crazy) solution :)

CDG.Axel on Sept. 19, 2021, 8:34 p.m.
Great, 3 lines! Sad that it will be too slow for large intervals

Different kind of sets

0 %

PyCharm The Python IDE for Professional Developers. Enjoy productive Python, web and scientific development with PyCharm. Download it now!