First clear solution for New Cities by Tinus_Trotyl - python coding challenges

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

First solution in Clear category for New Cities by Tinus_Trotyl

def subnetworks(net, crushes):
    base, subs = dict(), set()
    for node in net:
        for a, b in (0, 1), (1, 0):
            if not node[a] in crushes:
                connect = [] if node[b] in crushes else [node[b]]
                base[node[a]] = base[node[a]] + connect if node[a] in base else connect
    for node in list(base):
        if not (node in subs or any(i in subs for i in base[node])): subs |= {node} 
    return len(subs)

Aug. 22, 2017

Comments:

Merzix on Oct. 7, 2018, 4:40 p.m.
I wonder how your solution was accepted without passing on server assert subnetworks([ [ "A" , "B" ], [ "A" , "C" ], [ "A" , "D" ], [ "D" , "F" ], [ "B" , "C" ] ],[ "A" ]) == 2

zwerkoff on Oct. 14, 2020, 11:03 a.m.
for a, b in (0, 1), (1, 0) - cool

JulesSoulfly on Dec. 17, 2020, 8:02 a.m.
Looks nice, but can we get some explanation?

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.