Letters at Speed

Every letter code runs on alphabet positions. A six-letter word with a shift means six positions to find and six to turn back into letters. If each one costs you five seconds of counting on your fingers, a 35-second question turns into a minute. These four tools bring the counting down to almost nothing.

EJOTY

E, J, O, T and Y stand at positions 5, 10, 15, 20 and 25. Keep that one made-up word in your head and every other letter sits close to a landmark. K is one after J, so K = 11. N is one before O, so N = 14. M is two before O, so M = 13. Only A and B are more than two steps from a landmark, and you know those anyway. Until this is automatic, copy the A1 to Z26 row from the start of the chapter onto your rough sheet.

Counting from Z

Some codes use a letter's place counted from the end of the alphabet: Z = 1, Y = 2, and so on up to A = 26. You never need to count backward to find it. Take the usual position away from 27. L is 12th, so it is 27 − 12 = 15th from Z. O is 15th, so it is 27 − 15 = 12th from Z. When a code like 15 - 12 turns up for the letters L and O, this is the first thing to test.

Opposite pairs

Two letters are opposites when their positions add up to 27. Fold the alphabet in half between M and N and each letter lands on its partner.

Pair Pair Pair
A – Z F – U K – P
B – Y G – T L – O
C – X H – S M – N
D – W I – R
E – V J – Q

For a quick test, add the position of a letter to the position of its code letter. If the total is 27 every time, the code is made of opposites. If it is 29 every time, each opposite has also moved forward 2, because 27 + 2 = 29. The test reads cleanly as long as no move runs past Z.

Going past Z

When a forward move carries you beyond Z, take away 26: X + 4 gives 24 + 4 = 28, and 28 − 26 = 2, which is B. When a backward move goes before A, add 26: C − 4 gives 3 − 4 = −1, and −1 + 26 = 25, which is Y. Most wrong answers in shift codes are born at these two spots, and the options usually include the letter you would get by stopping at Z. So do the sum every time a move runs off either end.

The Order of Checks for Letter Codes

Most letter codes give way if you run the same short list of checks in the same order. The order matters because the early checks cost almost nothing. Do not start counting positions until you know you need them.

Step 1: Check for the same letters

Put the word and its code side by side. If the code uses exactly the same letters, nothing has moved along the alphabet. Only the order has changed, and you are looking at a rearrangement. Number the letters of the word 1, 2, 3 …, then write under the code the number each letter came from. For example: MOTHER → TOMREH gives 3 2 1 6 5 4, which is each half of the word read backward.

The patterns to look for are a full reversal, the two halves each reversed, neighbouring pairs swapped, the first and last letters swapped, all but the last letter reversed, and the letters put in alphabetical order.

Step 2: The first two moves

If the letters are different, find the move from the first letter of the word to the first letter of the code. Then do the same for the second letter.

  • The two moves are equal. Expect the same shift for every letter. Test it on the last letter next, since that is where a wrong rule usually shows itself.
  • The moves differ by 1 or 2. Expect a shift that grows: +1, +2, +3 … or +1, +3, +5 … Check the third letter.
  • The moves are two different numbers. They may take turns, as in +2, −1, +2, −1. Check the third and fourth letters.
  • The moves look random. Add each letter's position to its code letter's position. A steady 27 means opposites. If that fails too, read the word backward and compare again, because many two-step codes reverse the word and then shift it. Try the two halves reversed as well.
  • The moves repeat by letter type. If every vowel moves one way and every consonant another, the rule is about vowels and consonants, not about places.

Step 3: The second example

A rule that fits one word is still a guess. Run it over the whole second example before you touch the target. Two examples are given so that a wrong rule fails on one of them. A shift that grows by one each time and a pattern that repeats every three letters look the same on a three-letter word, for instance, but they split apart on a longer one.

For example: 'LUSH' is written as 'OXVK'. The letters are different, so skip Step 1. L → O is +3 and U → X is +3, so expect +3 for every letter. The last letter agrees, H → K (+3), and so does S → V. Only after the second example also passes do you work out the target.

Using the Options

Four answers are printed under every question, and one of them is right. You rarely need to build the whole code yourself. Work out just enough of it to leave one option standing.

First and last letters

In a letter code, work out only the first and the last letter of the answer. Strike out every option that misses either of them. Often only one option survives. If two are left, find the first place where they differ and work out that one letter.

For example: the rule is +2 on every letter and the target is MOTIF. M becomes O and F becomes H. Any option that does not start with O and end with H is gone, and you have not touched the three letters in the middle.

The ends are worth checking for a second reason. When the shift changes from letter to letter, the last letter carries the largest move or the end of the cycle, and that is where slips are made.

Digit strings: count the digits

When letters turn into numbers written side by side, the length of the answer is easy to predict. A to I have one-digit positions and J to Z have two. KALE is K, A, L, E, so its code has 2 + 1 + 2 + 1 = 6 digits. Count the digits of each option before you compare any of them. An option of the wrong length is out at once, and the slip of writing A as 01 shows up here straight away.

With positions counted from Z it is the other way round: R to Z count as 9 down to 1, one digit each, while A to Q give two digits.

Word values: odd or even

When a whole word becomes one number, check odd and even before you add anything. Only letters with odd positions can make a total odd. These are A, C, E, G, I, K, M, O, Q, S, U, W and Y. Count them in the word. An odd count gives an odd sum and an even count gives an even sum. Then allow for the rule: adding an odd number flips odd and even, adding an even number keeps it as it is.

For example: in MIST, the letters M (13), I (9) and S (19) are odd and T (20) is even. Three odd letters make the sum odd. If the rule is the sum + 3, the code must be even, and every odd option can be crossed out.

[SSC Tip] These checks can only throw options out. They never prove that the one left over is right, so spend five more seconds running the rule over the whole answer before you mark it.

Sentence and Digit Codes at Speed

Sentence codes and digit codes have nothing to do with the alphabet. They are about matching: which word or letter goes with which code. The danger is not a hard sum but going round in circles. Two habits stop that.

Start from the word that turns up most

Scan the sentences for the word that appears most often. Its code has to be the one code that appears in exactly those sentences. Fix it first and strike it out everywhere. Then take the next most common word and do the same. Each word you fix makes the next one quicker, because there are fewer codes left to choose from.

For example: 'lucky old men' is coded as 'ka ru te', 'old men knit' is coded as 'ru te zo' and 'men knit lace' is coded as 'zo te mi'. 'men' is in all three sentences, and 'te' is the only code in all three, so men = te. 'old' is in the first two, which share 'ru' and 'te'. With te gone, old = ru. In the same way 'knit' is in the last two, which share 'zo' and 'te', so knit = zo.

Keep a two-column table

Write each word and its code in two short columns on your rough sheet the moment you fix it. Do not carry the matches in your head. With four or five sentences, the table is what stops you from fixing the same word twice or losing one you already had.

Word Code
men te
old ru
knit zo

When two words never separate

If two words always appear together, in every sentence that has either of them, nothing in the question can split their codes. That is when the option written as "either 'xx' or 'yy'" is the right answer. Do not pick one of the two codes on its own, however likely it looks.

Digit codes

When each letter keeps its own digit in the same order, the same two-column table does all the work. Fill it from the examples once and read the target straight off it.

When the digits are jumbled, first make sure they really are. Find a letter that sits in the same place in two words but has different digits under it. Then match sets instead of places. The letters shared by two words go with the digits shared by their codes. A letter that is in only one word gets the digit left over once the shared ones are struck out.

For example: 'NOTE' is coded as '5829' and 'ONSET' is coded as '89275'. E is the fourth letter of both words, but the fourth digits are 9 and 7, so the digits are jumbled. The words share N, O, T and E, and the codes share 5, 8, 2 and 9. Strike those out of 89275 and 7 is left, so S = 7.

A Time Plan for Coding Questions

The Reasoning section has 25 questions and its own locked 15-minute clock, which is 36 seconds a question on average. A right answer earns 2 marks and a wrong one costs 0.5. Coding questions vary a lot in length, so give each kind its own budget instead of treating them all alike.

Targets

Type Target time
Letter shift, rearrangement and letter-number codes 25 to 35 seconds
Word values 25 to 35 seconds
Sentence codes and digit codes 30 to 40 seconds
Two-step codes and condition codes up to a minute

Time saved on the quick ones goes to the slow ones. A plain +2 code done in 25 seconds puts ten seconds in hand for a condition code later.

Time for each type

In shift codes it goes on positions, so use EJOTY and 27 − n instead of counting along the alphabet. In digit strings and word values it goes on adding, so run the length check or the odd-even check first and add only if two or more options are still alive. In sentence codes it goes on reading the same sentences again and again, which the two-column table prevents. In condition codes it goes on writing codes that you later have to change. Decide which condition applies from the first and last letters before you write a single symbol.

When to skip

Mark the question and move on when:

  • 30 seconds have passed on a letter code and the order of checks has given you nothing
  • a rule fits the first example but breaks on the second, and no better rule comes to mind
  • two rules fit both examples and point to different options
  • a full minute has gone on any coding question

If the checks in this section have cut the options down to two, a guess between them is worth taking. On average it earns 0.5 × 2 − 0.5 × 0.5 = 0.75 marks.

You can always come back to a skipped question. When you come back to it at the end, with the rest of the section done, you often see the rule at once.

Solved Questions

Question 1

In a certain code language, 'JOLT' is written as 'MROW' and 'LIMB' is written as 'OLPE'. How will 'OXEN' be written in that language?

(a) LUBK (b) RAHP (c) RAHQ (d) RBHQ

Answer. Use the landmarks. J is 10 and M is 13, so J moves +3. O is 15 and R is 18, another +3. L → O (+3) and T → W (+3) finish the word. LIMB agrees: L → O, I → L, M → P and B → E are all +3.

Now OXEN. O → R (+3). X is 24, and 24 + 3 = 27. That runs past Z, so take away 26: 27 − 26 = 1, which is A. Then E → H and N → Q. The code is RAHQ.

RBHQ is what you get by miscounting the turn at Z, and LUBK moves every letter back instead of forward. So the answer is (c) RAHQ.

Question 2

In a certain code language, 'KNOB' is coded as 'PMLY' and 'LIMP' is coded as 'ORNK'. How will 'NOISE' be coded in that language?

(a) MLRHV (b) MLRHU (c) NLRHV (d) MLQHV

Answer. K to P is +5, but N to M is −1. The moves jump about, so a plain shift is out. Add the positions instead: K + P = 11 + 16 = 27, N + M = 14 + 13 = 27, O + L = 15 + 12 = 27 and B + Y = 2 + 25 = 27. Every letter has been swapped for its opposite. LIMP checks out the same way, with L ↔ O, I ↔ R, M ↔ N and P ↔ K.

For NOISE, take each position away from 27. N is 14, and 27 − 14 = 13, which is M. O is 15, giving 12, which is L. I gives R, S gives H and E gives V. If you know the pair table, you can read them off without any sums: N–M, O–L, I–R, H–S, E–V.

So the answer is (a) MLRHV.

Question 3

In a certain code language, 'MANTLE' is written as 'NAMELT' and 'JOCKEY' is written as 'COJYEK'. How will 'LIZARD' be written in that language?

(a) DRAZIL (b) ZILDRA (c) ZILDAR (d) LIZDRA

Answer. Before counting anything, look at the letters. NAMELT uses exactly the letters of MANTLE, and COJYEK uses the letters of JOCKEY. No letter has changed, only the order. That saves you all the position work.

Split MANTLE into MAN and TLE. MAN read backward is NAM, and TLE read backward is ELT. Together they make NAMELT. JOCKEY works the same way: JOC → COJ and KEY → YEK. So each half is reversed on its own.

LIZARD splits into LIZ and ARD, which become ZIL and DRA. DRAZIL reverses the whole word, which is a different rule: it would have turned MANTLE into ELTNAM. So the answer is (b) ZILDRA.

Question 4

In a certain code language, 'INCH' is coded as 'JPFL' and 'MOLAR' is coded as 'NQOEW'. How will 'NOVEL' be coded in that language?

(a) OQYHQ (b) OQXIQ (c) PQYIQ (d) OQYIQ

Answer. The letters are different, so this is a shift of some kind. Take the first two moves of INCH: I → J (+1) and N → P (+2). They are not equal, but they differ by 1, so test a growing shift. C → F is +3 and H → L is +4. It grows by one every time.

Now the second example. It is one letter longer, so it also tests the fifth step: M → N (+1), O → Q (+2), L → O (+3), A → E (+4), R → W (+5). The rule holds all the way.

NOVEL: N → O (+1), O → Q (+2), V → Y (+3), E → I (+4), L → Q (+5). That gives OQYIQ.

Time check: about 30 seconds, because the longer example fixed the rule for all five places at once. So the answer is (d) OQYIQ.

Question 5

In a certain code language, 'MEADOW' is written as 'ODCCQV' and 'KERNEL' is written as 'MDTMGK'. How will 'NUGGET' be written in that language?

(a) PWIIGV (b) PTIFGS (c) PTIHGS (d) MTFFDS

Answer. M → O (+2), E → D (−1), A → C (+2), D → C (−1). The moves take turns: +2, then −1. KERNEL follows the same beat: K → M, E → D, R → T, N → M, E → G, L → K.

You do not need all six letters of NUGGET yet. The first letter takes +2, so N → P. The sixth letter takes −1, so T → S. Now look down the options. PWIIGV ends in V and MTFFDS starts with M, so both go.

Two options are left, PTIFGS and PTIHGS, and they differ only in the fourth letter. The fourth place takes −1, and G → F. So the answer is (b) PTIFGS, found with three letters worked out instead of six.

Question 6

In a certain code language, 'KNOT' is coded as '11141520' and 'JADE' is coded as '10145'. How will 'OVEN' be coded in that language?

(a) 15220514 (b) 1621514 (c) 1522514 (d) 1522513

Answer. Split the codes into positions. 11, 14, 15, 20 are K, N, O, T, and 10, 1, 4, 5 are J, A, D, E. Each letter is written as its place in the alphabet, side by side.

Count digits before anything else. O, V and N come after I, so each of them gives two digits, while E gives one. That makes 2 + 2 + 1 + 2 = 7 digits. The option 15220514 has 8 digits, because it writes E as 05, so it goes at once.

Among the 7-digit codes, read in pairs: O = 15, V = 22, E = 5, N = 14. 1621514 starts with 16, which is P, and 1522513 ends with 13, which is M. So the answer is (c) 1522514.

Question 7

In a certain code language, 'LOAF' is coded as '38' and 'JUICE' is coded as '52'. How will 'NAVY' be coded in that language?

(a) 66 (b) 62 (c) 65 (d) 71

Answer. Add the positions first. LOAF: 12 + 15 + 1 + 6 = 34, and the code 38 is 4 more. JUICE: 10 + 21 + 9 + 3 + 5 = 48, and 52 is again 4 more. So the code is the sum of the positions + 4. It is not the sum plus the number of letters: that fits LOAF but would give 53 for JUICE.

Before adding NAVY, check odd and even. Only letters with odd positions can make a sum odd. In NAVY, A (1) and Y (25) are odd, while N (14) and V (22) are even. Two odd numbers make an even total, and adding 4 keeps it even. That rules out 65 and 71.

Two options are left. The sum is 14 + 1 + 22 + 25 = 62, and 62 + 4 = 66. The option 62 forgets the +4. So the answer is (a) 66.

Question 8

In a certain code language, 'monks love jam' is coded as 'ta fe ru', 'jam is nice' is coded as 'lo ta ko' and 'monks like nice jam' is coded as 'wi ta fe lo'. What is the code for 'like' in that language?

(a) lo (b) fe (c) ta (d) wi

Answer. Start with the word that turns up most often. 'jam' is in all three sentences, and the only code in all three is 'ta'. So jam = ta.

'monks' is in the first and third sentences. Apart from 'ta', those two share only 'fe', so monks = fe. 'nice' is in the second and third, and apart from 'ta' they share 'lo', so nice = lo.

Keep a two-column table as you go:

Word Code
jam ta
monks fe
nice lo

The third sentence has four codes: wi, ta, fe and lo. Three of them are now taken, so like = wi. So the answer is (d) wi.

Question 9

In a certain code language, 'MOLD' is coded as '5739' and 'JOKE' is coded as '1764'. How will 'MODEL' be coded in that language?

(a) 57934 (b) 57943 (c) 57493 (d) 75943

Answer. O is the second letter of both words, and both codes have 7 in the second place. Nothing clashes, so read each letter's digit in order. Write the pairs once in a two-column table instead of hunting through the examples for every letter:

Letter Digit
M 5
O 7
L 3
D 9
J 1
K 6
E 4

Now read MODEL straight down the table: M = 5, O = 7, D = 9, E = 4, L = 3. The code is 57943.

All four options use the same five digits, so the order is the whole question. 57934 swaps the last two. So the answer is (b) 57943.

Question 10

In a certain code language, 'LIME' is coded as '4927' and 'MILK' is coded as '2796'. What is the code for 'K' in that language?

(a) 4 (b) 7 (c) 6 (d) 9

Answer. First see whether the digits follow the letters. I is the second letter of both words, but the second digit is 9 in one code and 7 in the other. So the digits are jumbled, and you have to match sets, not places.

The two words share L, I and M. The two codes share 2, 7 and 9. So those three digits belong to L, I and M in some order. Strike them out of MILK's code: 2796 leaves 6, and that must be K. In the same way, LIME's code leaves 4 for E.

The option 4 is E's digit, not K's. So the answer is (c) 6.

Question 11

In a certain code language, 'NUMB' is written as 'CNVO' and 'OPAL' is written as 'MBQP'. How will 'KNIFE' be written in that language?

(a) FGJOL (b) LOJGF (c) FGJNL (d) EFINK

Answer. Line up NUMB and CNVO: N → C, U → N, M → V, B → O. The moves are −11, −7, +9 and +13, which make no pattern at all. When the moves look random, read the word backward and compare again. NUMB backward is BMUN, and B → C, M → N, U → V, N → O are all +1.

OPAL agrees. Backward it is LAPO, and L → M, A → B, P → Q, O → P.

So the rule is to reverse the word first and then move each letter forward 1. KNIFE backward is EFINK, and EFINK + 1 gives FGJOL. LOJGF is what you get if you shift without reversing. So the answer is (a) FGJOL.

Question 12

In a certain code language, 'MASK' is written as 'OCUM' and 'INLET' is written as 'KPNGV'. Which word is written as 'LWODNG' in that language?

(a) JINGLE (b) JUGGLE (c) JOSTLE (d) JUMBLE

Answer. Each letter moves forward 2: M → O, A → C, S → U, K → M, and INLET gives K, P, N, G, V the same way. To decode, go the other way and take 2 back.

You need not decode the whole code. All four options start with J and end with LE, so only the middle letters can tell them apart. The second code letter is W, and W − 2 = U. That rules out JINGLE and JOSTLE. The third code letter is O, and O − 2 = M. Of the two words left, only JUMBLE has M there.

A full check: JUMBLE + 2 gives L, W, O, D, N, G. So the answer is (d) JUMBLE.

Question 13

In a certain code language, 'IDOL' is coded as '68' and 'OPERA' is coded as '80'. How will 'MAGNET' be coded in that language?

(a) 60 (b) 96 (c) 102 (d) 75

Answer. The plain sums are far from the codes: IDOL gives 9 + 4 + 15 + 12 = 40, and OPERA gives 15 + 16 + 5 + 18 + 1 = 55. Try positions counted from Z. IDOL: I = 18, D = 23, O = 12, L = 15, and 18 + 23 + 12 + 15 = 68. OPERA: 12 + 11 + 22 + 9 + 26 = 80. Both match.

Here is the quick way. A letter's two positions always add up to 27. So for a word of n letters, the sum counted from Z is 27 × n minus the ordinary sum. Check it on IDOL: 27 × 4 − 40 = 108 − 40 = 68.

MAGNET has 6 letters, and its ordinary sum is 13 + 1 + 7 + 14 + 5 + 20 = 60. So the code is 27 × 6 − 60 = 162 − 60 = 102.

60 is the ordinary sum, and 96 comes from counting from Z as 26 − n instead of 27 − n. So the answer is (c) 102.

Question 14

In the following question, the letters are coded as given below.

Letter: I K M A E P O J N L U R

Code: 4 @ 7 % 2 # 9 & 5 1 ∆ 8

Conditions:

(i) If the first letter is a vowel and the last letter is a consonant, their codes are to be interchanged.

(ii) If both the first and the last letters are consonants, both are to be coded as the code for the last letter.

(iii) If both the first and the last letters are vowels, both are to be coded as '©'.

Find the code for the letter group OKMJAP.

(a) 9@7&%# (b) #@7&%9 (c) #@7&%# (d) ©@7&%©

Answer. Look at the two ends of the group before you go near the table. OKMJAP starts with O, a vowel, and ends with P, a consonant. That is exactly condition (i), and the other two cannot apply.

Now write the codes in order: O = 9, K = @, M = 7, J = &, A = %, P = #. That gives 9@7&%#. Condition (i) says the first and last codes change places, so 9 and # swap: #@7&%9.

The option 9@7&%# is the plain code with the condition forgotten, the commonest slip in these questions. So the answer is (b) #@7&%9.

Time check: deciding the condition first and writing the codes only once keeps this well under a minute.