First clear solution for Pawn Brotherhood by spoty - python coding challenges

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

First solution in Clear category for Pawn Brotherhood by spoty

def safe_pawns(pawns):
    b =  [(ord(p[0]) - 97, int(p[1]) -1) for p in pawns]
    return len([x for x in b if (x[0]-1, x[1]-1) in b or (x[0]+1, x[1]-1) in b])

Oct. 17, 2014

Comments:

suic on April 13, 2015, 5:12 p.m.
<p>Hi, a bit shorter:</p> <pre class='brush: python'>return sum((x[0]-1, x[1]-1) in b or (x[0]+1, x[1]-1) in b for x in b) </pre>

Look up in the Dict()

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.