Second 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.

Second solution in Clear category for Surjection Strings by kazuki.h

def isometric_strings(str1, str2):
    return str2 == "".join(dict(zip(str1, str2))[c] for c in str1)

Dec. 6, 2022

Comments:

StefanPochmann on April 8, 2024, 6:49 p.m.
We should have a "Tardy" category for highly inefficient solutions like this :-P

kazuki.h on April 9, 2024, 2:52 p.m.
What do you mean?

StefanPochmann on April 9, 2024, 3:24 p.m.
Do you mean why it's highly inefficient? You don't see it? For every `c`, you build an entire dict from the two entire strings, look up one key, and then throw that dict away. This solution takes quadratic time, when linear time is so easy. Hence the opposite of "Speedy".

kazuki.h on April 9, 2024, 3:51 p.m.
This answer was posted in Clear tags. What do you want?

Strings Theory

0 %

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