First clear solution for Pawn Brotherhood by mlahor - 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 mlahor

def safe_pawns(pawns: set) -> int:
    safe_no=0
    for pawn in pawns:
        p1=chr(ord(pawn[0])-1)+str(int(pawn[1])-1)
        p2=chr(ord(pawn[0])+1)+str(int(pawn[1])-1)
        safe_no += p1 in pawns or p2 in pawns
    return safe_no

Oct. 28, 2019

Comments:

maxnrg on Dec. 12, 2019, 8:40 p.m.
the same approach with f-strings: ``` def safepawns(pawns: set) -> int: """ Get the number of safe pawns """ safecount = 0 for pawn in pawns: # for "b4" leftdefender is "b3" and rightdefender is "c3 leftdefender = f'{chr(ord(pawn[:1]) - 1)}{int(pawn[1:]) - 1}' rightdefender = f'{chr(ord(pawn[:1]) + 1)}{int(pawn[1:]) - 1}' if leftdefender in pawns or rightdefender in pawns: safecount += 1 return safecount ```

maxnrg on Dec. 12, 2019, 8:43 p.m.
also `+= True` is a nice trick, but not so clear for understanding :)

Look up in the Dict()

0 %

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