one line clear solution for Surjection Strings by kazuki.h - python coding challenges

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

one line solution in Clear category for Surjection Strings by kazuki.h

def isometric_strings(str1: str, str2: str) -> bool:
    return str2 == "".join([{str1[i]: str2[i] for i in range(len(str1))}[str1_c] for str1_c in str1])

April 3, 2021

Comments:

jakubbortlik on Dec. 6, 2022, 6:53 a.m.
Oh, a dictionary comprehension in a list comprehension, nice. Maybe this would be a bit clearer: ``` return str2 == "".join({s1: s2 for s1, s2 in zip(str1, str2)}[char] for char in str1) ``` The square brackets of the list comprehension are not needed, actually this is now a generator expression which is the only expression in the `''.join()` call and does not need an extra pair of parentheses. Also, `zip()` is more elegant than indexing when looping over two iterables at the same time.

kazuki.h on Dec. 6, 2022, 10:59 a.m.
Thanks for your idea. <a href="https://py.checkio.org/mission/isometric-strings/publications/kazuki.h/python-3/second/">https://py.checkio.org/mission/isometric-strings/publications/kazuki.h/python-3/second/</a>

kazuki.h on Dec. 6, 2022, 10:55 a.m.
my new solution(12/06/2022) <a href="https://py.checkio.org/mission/isometric-strings/publications/kazuki.h/python-3/second/">https://py.checkio.org/mission/isometric-strings/publications/kazuki.h/python-3/second/</a>

Strings Theory

0 %

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