Tags: python
Rating:
This challenge could've easily been solved using https://www.dcode.fr/rot-cipher
enc = "g!0{]n`7*+0y~+1|(!y.+0yKM9" print("".join([chr(ord(i)-26) if chr(ord(i)-26).isalnum() else chr(ord(i)+68) for i in enc]))
I don't remember