You’ve caught two of your fellow minions passing coded notes back and forth - while they’re on duty, no less! Worse, you’re pretty sure it’s not job-related - they’re both huge fans of the space soap opera "Lance & Janice". You know how much Commander Lambda hates waste, so if you can prove that these minions are wasting her time passing non-job-related notes, it’ll put you that much closer to a promotion.

Fortunately for you, the minions aren’t exactly advanced cryptographers. In their code, every lowercase letter [a..z] is replaced with the corresponding one in [z..a], while every other character (including uppercase letters and punctuation) is left untouched.

That is, a => z, b => y, c => x, etc.

For instance, the word "vmxibkgrlm", when decoded, would become "encryption".

Write a function called solution(s) which takes in a string and returns the deciphered string so you can show the commander proof that these minions are talking about Lance & Janice instead of doing their jobs.

Test Cases

Your code should pass the following test cases. Note that it may also be run against hidden test cases not shown here.

Input:

(string) s = "wrw blf hvv ozhg mrtsg'h vkrhlwv?"

Output:

(string) "did you see last night's episode?"

Input:

(string) s = "Yvzs! I xzm'g yvorvev Lzmxv olhg srh qly zg gsv xlolmb!!"

Output:

(string) "Yeah! I can't believe Lance lost his job at the colony!!"

Solutions

class Solution {
    public static String solution(String s) {
        int l = s.length();
        char[] chars = s.toCharArray();
        for (int i = 0; i < l; i++) {
            char c = chars[i];
            if (c >= 'a' && c <= 'z') {
                int pos = c - 'a';
                chars[i] = (char) ('a' + 25 - pos);
            }
        }
        return String.valueOf(chars);
    }
    
    public static void main(String[] args) {
        String s1 = "wrw blf hvv ozhg mrtsg'h vkrhlwv?";
        System.out.println(Solution.solution(s1));

        String s2 = "Yvzs! I xzm'g yvorvev Lzmxv olhg srh qly zg gsv xlolmb!!";
        System.out.println(Solution.solution(s2));
    }
}
def solution(x):
    l = len(x)
    final = []
    for i in range(l):
        c = x[i]
        if 'a' <= c <= 'z':
            pos = ord(c) - ord('a')
            final.append(chr(ord('a') + 25 - pos))
        else:
            final.append(c)
    return ''.join(final)


if __name__ == "__main__":
    t1 = "wrw blf hvv ozhg mrtsg'h vkrhlwv?"
    print(solution(t1))

    t2 = "Yvzs! I xzm'g yvorvev Lzmxv olhg srh qly zg gsv xlolmb!!"
    print(solution(t2))