Brute force clear solution for Break Rings by nickie - python coding challenges

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

Brute force solution in Clear category for Break Rings by nickie

from itertools import chain, combinations

def break_rings(rings):
    N = max(map(max, rings))
    R = range(1, N+1)
    for S in chain.from_iterable(combinations(R, r) for r in range(N+1)):
        if not any(map(set(S).isdisjoint, rings)):
            return len(S)

Feb. 3, 2015

Comments:

wujie on Feb. 9, 2015, 9:36 p.m.
<p>This is fascinating. My code is about 10 times longer.</p>

hrvoje on July 3, 2015, 7:51 p.m.
<p>chain.from_iterable is so very cool and readable! Cool solution.</p>

GitHub

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.