Change for the "Transformation" challenge

[mfocka]

Even though this was not the hardest problem and everybody can find the solution themselves, it seems like there may be a better solution when you see a small logical step in this problem.
Instead of looping over every value between 0 and 126, note that you can just find your second value by subtraction.

(I did something quickly in python for demonstration purposes):

def decode():
    res = []
    for char in CODE:
        o = ord(char)
        first = o >> 8
        second = o - (first << 8)
        res.append(chr(first))
        res.append(chr(second))