Difficulty: Easy
Correct Answer: SQDOXN
Explanation:
Introduction / Context:
This coding–decoding question uses the classic Atbash cipher, where each letter is replaced by its mirror across the alphabet (a↔z, b↔y, c↔x, …, m↔n). After substitution, the result must be written in uppercase.
Given Data / Assumptions:
Concept / Approach:
For each letter x, compute its mirror y such that position(x) + position(y) = 27 (using a=1..z=26). Then convert the mapped string to uppercase.
Step-by-Step Solution:
Verification / Alternative check:
Double-apply Atbash to SQDOXN; it returns to HJWLCM, confirming correctness.
Why Other Options Are Wrong:
Common Pitfalls:
Mistaking m→n (the middle pair) and swapping the letters order. Work left-to-right applying the mirror rule precisely.
Final Answer:
SQDOXN
Discussion & Comments