Counter clear solution for One line Drawing by gyahun_dash - python coding challenges

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

Counter solution in Clear category for One line Drawing by gyahun_dash

import collections, itertools

def draw(segments):
    edges = [{s[:2], s[2:]} for s in segments]
    counter = collections.Counter(itertools.chain(*edges))
    nodes = set(counter)

    src = max(nodes, key = lambda n: counter[n] % 2)
    drawing = [src]

    while edges:
        candidates = [n for n in nodes if {src, n} in edges]
        if not candidates: return []
        dst = max(candidates, key = counter.get)
        drawing.append(dst)

        edge = {src, dst}
        edges.remove(edge)
        counter.subtract(edge)
        src = dst

    return drawing

Sept. 2, 2014

Comments:

nawaratwrn on Aug. 22, 2015, 9:56 a.m.
I wander how this can overcome the case that we need to search. e.g. draw({(1,1,2,2),(2,1,2,2),(2,1,3,2),(2,1,3,1),(1,1,0,2),(1,1,0,0),(3,2,3,1),(0,0,0,2)}) and draw({(0,0,0,1),(1,0,0,0),(1,0,0,1),(1,0,3,0),(3,0,4,0),(3,0,4,1),(4,0,4,1)})

nanpa on Dec. 19, 2015, 12:29 a.m.
Excuse me, but I cannot pass "Extra Test 6/6" with this solution. Only me? Can you pass the test?

nanpa on Dec. 19, 2015, 12:57 a.m.
This one. <pre class='brush: python'>draw({(0,0,0,1),(1,0,0,0),(1,0,0,1),(1,0,3,0),(3,0,4,0),(3,0,4,1),(4,0,4,1)}) </pre>

CDG.Axel on Nov. 3, 2021, 9:11 p.m.
It fails in Extra Test 5/6 now

abupoonjaby on Feb. 9, 2016, 1:01 a.m.
Great job! Nice clean code.

ljy95135 on May 31, 2016, 3:53 p.m.
Great,never thought that it can be so easy.

dmitryOk on April 30, 2018, 6:25 a.m.
Test 6

Dropbox

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.