Most coding-decoding questions replace each letter of a word with another letter, or with a number, according to a fixed rule. The rule is almost always about a letter's position in the alphabet: A = 1, B = 2, up to Z = 26. If you can turn letters into numbers quickly, you can see the rule quickly.

The standard memory aid is EJOTY: E = 5, J = 10, O = 15, T = 20, Y = 25. To find R, count two back from T (20): R = 18. Every letter is within two steps of an anchor.

LetterAEJMOTWYZ
Position1510131520232526
Opposite letterZVQNLGDBA

The simplest rule moves every letter the same number of places. Compare the first letter of the word with the first letter of its code, find the gap, and check that the same gap works for the second letter before applying it to the new word.

Worked example 1: shift by +1

If COLD is coded as DPME, each letter has moved one place forward. Applying the same rule to any other word, every letter moves forward by one.

Worked example 2: shift by +2

TABLE moved two places forward becomes VCDNG: T→V, A→C, B→D, L→N, E→G.

Shifts wrap round the end of the alphabet: after Z comes A again. Treat the alphabet as a circle of 26 letters.

Worked example 3: wrapping round

XYZ shifted three places forward becomes ABC, because X→Y→Z→A, and likewise for Y and Z.

When a fixed shift does not fit, write down the shift for each letter. A common pattern is +1, +2, +3, +4, where each letter moves by its own position in the word.

Worked example 4: growing shift

BOOK with shifts +1, +2, +3, +4: B→C, O→Q, O→R, K→O, giving CQRO. Note that the two O's are coded differently, which is a quick sign of a position-based rule.

Other patterns you may meet are alternating shifts (+1, −1, +1, −1), shifts that fall (+4, +3, +2, +1), or a word written backwards and then shifted.

Worked example 5: reverse the word, then shift

PLAN written backwards is NALP. Shifting each letter by +1 gives OBMQ. If the code's letters look like the word's letters in reverse order, try reversing first.

In this code each letter is replaced by the letter the same distance from the other end: A↔Z, B↔Y, C↔X and so on. The two positions always add up to 27, so the opposite of a letter at position n is at position 27 − n.

Worked example 6: MANGO

M(13)→N(14), A(1)→Z(26), N(14)→M(13), G(7)→T(20), O(15)→L(12). MANGO becomes NZMTL.

A useful set of pairs to remember is the word pairs that are already opposite letters: A–Z, B–Y, C–X, D–W, E–V, F–U, G–T, H–S, I–R, J–Q, K–P, L–O, M–N. If you forget a pair, use the rule that the two positions add up to 27.

A different style gives several coded sentences, such as "sky is blue" written as "ka pa ta" and "blue is deep" written as "ta ra ka", and asks for the code of one word. Here letter positions do not help; compare sentences instead. A word that appears in two sentences must have the code that appears in both. In this example, "is" and "blue" are shared, and so are "ka" and "ta", so "sky" must be "pa" and "deep" must be "ra". Work out the single-word differences first, then use them to separate the shared codes, and say "cannot be determined" if two codes are always seen together.

When a word is coded as a single number, try the sum of letter positions first, then the product, then the sum of opposite positions.

Worked example 7: sum of positions

CAT = 3 + 1 + 20 = 24. If DOG is given as 26 (4 + 15 + 7), the sum rule is confirmed before you apply it.

Sometimes each letter becomes its own number and the numbers are written side by side, so CAT is 3120. Look at the length of the code: a long string of digits usually means letter-by-letter numbers, while a short number usually means a sum.

  • ✘ Testing the rule on only one letter. Confirm it on at least two before using it.
  • ✘ Forgetting to wrap from Z back to A.
  • ✘ Mixing up forward and backward shifts. Check the direction on the first letter.
  • ✘ Assuming a fixed shift when repeated letters are coded differently.

More reasoning methods: direction sense, calendars and clock angles.

Q1. If GAME is written as HBNF, how is PLAY written in that code? easy

✅ Answer: (a) QMBZ

💡 Explanation: Each letter moves one place forward: G→H, A→B, M→N, E→F. So P→Q, L→M, A→B and Y→Z, giving QMBZ.

Q2. If RAIN is coded as TCKP, how is SNOW coded? easy

✅ Answer: (c) UPQY

💡 Explanation: Each letter moves two places forward (R→T, A→C, I→K, N→P). So S→U, N→P, O→Q and W→Y, giving UPQY.

Q3. In a code each letter is replaced by its opposite in the alphabet (A↔Z, B↔Y and so on). How is LIGHT written? medium

✅ Answer: (d) ORTSG

💡 Explanation: Opposite letters add up to 27: L(12)→O(15), I(9)→R(18), G(7)→T(20), H(8)→S(19), T(20)→G(7). LIGHT becomes ORTSG.

Q4. If DOG is coded as 26, using the sum of the letters' positions, what is the code for CAT? easy

✅ Answer: (b) 24

💡 Explanation: DOG = 4 + 15 + 7 = 26 confirms the rule. CAT = 3 + 1 + 20 = 24.

Q5. If each letter is moved three places back in the alphabet, how is WORD written? easy

✅ Answer: (a) TLOA

💡 Explanation: W→T, O→L, R→O, D→A. ZRUG is the result of moving three places forward instead.

Q6. Each letter of a word is moved forward by its position in the word (first letter +1, second +2, and so on). How is CODE written? medium

✅ Answer: (c) DQGI

💡 Explanation: C+1 = D, O+2 = Q, D+3 = G, E+4 = I, giving DQGI.

How do I find letter positions quickly?

Memorise EJOTY: E is 5, J is 10, O is 15, T is 20 and Y is 25. Every letter is at most two places from one of these anchors, so you can count to any position in one or two steps instead of counting from A.

What if the shift pattern is not the same for every letter?

Write the change for each letter as a number, such as +1, +2, +3, or +2, −2, +2. The numbers usually form a simple pattern, increasing by one, alternating in sign, or matching the letter's place in the word.

All problems and solutions on this page are original. No outside facts are relied on; every numeric answer is recomputed by software before publishing.

How this page was prepared. Drafted with AI assistance (Claude (Anthropic AI model)) from the sources listed above. 13 calculations on this page were recomputed by software and matched. Automated checks also covered structure, internal links and duplicate text. Software checks cannot confirm facts. Reviewed by praveen on 2026-10-20 against the sources listed above.

Found an error? Report it and we will correct the page.