Coding-decoding is one of the most mechanical topics in SSC CGL Reasoning — and that is both good and bad news. Good: once you identify the pattern, you cannot get it wrong. Bad: if you spend time hunting for the pattern in the exam hall, you bleed precious seconds.
Here is the central idea. A coding-decoding question gives you one or two "key" pairs — a word and its coded form — then asks you to apply the same logic to a new word. Your only job is to reverse-engineer the rule from the key pair and apply it accurately.
Think of it like a lock. Every coding question has exactly one key — the transformation rule. The key pair is the lock being opened in front of you. You just watch, understand the mechanism, then open the next lock yourself.
There are four broad families of coding questions in SSC CGL:
Letter-shift codes. Each letter moves a fixed number of positions forward or backward in the alphabet. The shift can be uniform (every letter shifts by the same amount) or it can follow a pattern (alternating shifts, position-dependent shifts).
Position-number codes. Letters are replaced by their serial number in the English alphabet: A=1, B=2, C=3 ... Z=26. Variants include reverse numbering (A=26, Z=1), or derived numbers (like A=2, B=3, meaning position+1).
Substitution or word codes. Whole words in a sentence are assigned code words. A given sentence is encoded; you identify which code word corresponds to which real word through overlap across two or more coded sentences.
Mixed or conditional codes. These combine a shift with a reversal, or apply one rule to consonants and a different rule to vowels, or shuffle letter positions within the word before applying a shift.
The analogy that helps: think of the alphabet as a circular railway track with 26 stations, labeled A through Z. A shift-by-3 code is like boarding a train at station A and riding three stops to station D. The wrap-around (Z→C for a +3 shift) is just the train completing the loop past station Z and continuing from A.
Once you internalize that mental map of the alphabet as a circle, letter-shift questions stop feeling like calculation and start feeling like reading.
Before anything else, internalize the standard A=1 to Z=26 mapping. In the exam, you will not have time to count on your fingers. Here is the key segment candidates most often get wrong:
A=1, B=2, C=3, D=4, E=5, F=6, G=7, H=8, I=9, J=10, K=11, L=12, M=13
N=14, O=15, P=16, Q=17, R=18, S=19, T=20, U=21, V=22, W=23, X=24, Y=25, Z=26
The "EJOTY" trick gives you anchor points: E=5, J=10, O=15, T=20, Y=25. From any anchor you can reach any letter in at most 4 steps.
This is the most common type in SSC CGL. The rule: every letter in the plaintext moves by the same fixed number of positions.
Identifying the shift: Take the first letter of the given word and its coded equivalent. Compute the difference in their position numbers. Verify with one more letter. If consistent, you have the shift.
Example: MANGO → PDQJR
For the new word, apply +3 to each letter. A(1)+3=D(4), P(16)+3=S(19), L(12)+3=O(15), E(5)+3=H(8) → DSSOH.
Wrap-around handling: When a shift takes you past Z, wrap around. Z+1=A, Z+2=B, Z+3=C. Formally: new position = (old position + shift − 1) mod 26 + 1. In practice, just remember: after Z comes A again.
Example: Z+3 → C. Y+3 → B. X+3 → A.
Backward shifts (negative): PDQJR → MANGO would be a −3 shift. A−3=X (wrap back), B−3=Y, C−3=Z.
Every letter is replaced by its ordinal position: A=1, B=2 ... Z=26.
Spot this type immediately when the coded form is a string of numbers separated by hyphens or spaces. Verify: does the number match the alphabet position?
Example: FLOWER → 6-12-15-23-5-18
For GARDEN: G=7, A=1, R=18, D=4, E=5, N=14 → 7-1-18-4-5-14.
Variant: reverse position (A=26, Z=1). Check if the numbers add up to 27 with the standard positions. If F=6 normally but appears as 21 in the code, then 6+21=27, confirming A=26 reverse scheme.
These questions give you two coded sentences and ask you to identify what a specific word codes to.
Strategy — look for the unique word (appears in one sentence only). Whatever it is coded as is its unambiguous code. Then use overlap between sentences to crack the rest.
For example:
"ka" appears in both → "ka" = "the". Now each remaining word has a unique code.
This type rarely appears in isolation in CGL Tier-1, but it does appear as part of mixed sets.
These involve one or more of:
Detection tip: If a uniform shift does not work after you verify two or three letters, look for a pattern in the inconsistency. Check: are the letters at odd positions (1st, 3rd, 5th) behaving one way and even positions (2nd, 4th) another way?
Work through every letter and write down the shift you compute. If the shifts alternate between two values (say +2 and −1 alternately), that is your rule.
Across recent SSC CGL papers, the dominant pattern is uniform letter shift (+1, +2, or +3 are most common). Position-number codes (A=1...Z=26) are the second most frequent. Substitution codes and reversal-based codes appear less often but do show up in harder sets.
The key speed strategy: do not work through every letter of the key pair before starting the answer word. Verify the rule with two letters. If both confirm the same shift, apply it directly to the answer word. You save 15–20 seconds per question.
Memorize five anchor positions: E=5, J=10, O=15, T=20, Y=25. Every other letter is within 4 steps of an anchor. Instead of counting from A every time, count from the nearest anchor. To find R: R is 3 after O(15), so R=18. Standard method (count from A): 18 steps, roughly 8 seconds. EJOTY method: spot O=15, add 3, done in under 2 seconds. That is a 4x speed gain on position lookups.
Never verify the shift across all letters of the key word. Check only the 1st and 2nd letters. If both give the same shift value, lock in the rule and move to the answer word immediately. If they differ, check the 3rd letter to see whether there is an alternating pattern. This cuts verification time from 5 letters to 2–3 letters — saving roughly 20 seconds per question against full letter-by-letter checking.
When a +k shift takes you past Z, the result is simply: (position + k) − 26. So Z+3 = (26+3)−26 = 3 = C. Z+1=A, Z+2=B, Z+5=E. Going backward: A−1=Z, A−2=Y, A−k = (1−k)+26 = 27−k. Memorize: "subtract 26 going forward past Z, add 26 going backward past A." This eliminates the mod arithmetic under exam pressure. Standard confusion: 15–25 seconds of hesitation. With this rule: instant.
Suspect A=26 reverse scheme when numbers seem too large or don't match A=1. Quick check: add the coded number to the standard position number. If the sum is always 27, you have a reverse-position code (because standard + reverse = 1 + 26 = 27 for every letter). Example: if B codes to 25, then 2+25=27. Confirmed reverse scheme. Apply: any letter's reverse code = 27 − standard position. This check takes 3 seconds vs. 20+ seconds of trial-and-error.
When you are unsure of the exact shift, look at the answer options first and check only the first letter of the answer word against each option. If three options start with the same letter and one is different, compute whether the first letter's shift matches any. Discard options that cannot match the first letter's shift. In most CGL letter-shift questions, this eliminates 2–3 options immediately, reducing the verification needed. Saves: 10–15 seconds when the shift is ambiguous on first look.
When you see a coding-decoding question in the exam hall, run this decision tree in under 5 seconds:
Step 1 — Is the code letters or numbers?
Step 2 — Check the first letter's shift.
Compute: (coded letter position) − (original letter position). Call this d.
Step 3 — Verify with the second letter.
Same d? → Uniform shift confirmed. Apply d to every letter of the answer word.
Different d? → Check if 3rd letter matches the 1st letter's d. If yes, alternating shift. Map odd positions → d1, even positions → d2.
Step 4 — Handle wrap-around. For each letter in the answer word: if (position + d) > 26, subtract 26. If (position + d) < 1, add 26.
Step 5 — Use options to cross-check the first 1–2 letters. If your computed answer matches one option and the others differ at letter 1 or 2, pick your answer confidently without computing every letter.
Target: 40–60 seconds per question. With practice, this drops to 30–40 seconds.
Why this question: This is the single most common CGL coding type — uniform +3 shift. Getting the wrap-around right is the differentiator.
Solving path: M(13)+3=P(16) ✓, A(1)+3=D(4) ✓ — shift confirmed as +3. Apply: A(1)+3=D, P(16)+3=S, P(16)+3=S, L(12)+3=O, E(5)+3=H → DSSOH. Answer: Option A.
Why this question: A +1 shift is the simplest variant but appears frequently as a confidence-check question. Many candidates over-think it.
Solving path: W(23)+1=X(24) ✓, A(1)+1=B(2) ✓ — shift is +1. For SPACE: S(19)+1=T, P(16)+1=Q, A(1)+1=B, C(3)+1=D, E(5)+1=F → TQBDF. Answer: Option A.
Why this question: Same +1 shift but introduces wrap-around (Z→A). If you miss the wrap, you pick a wrong option.
Solving path: L(12)+1=M ✓, O(15)+1=P ✓ — shift +1 confirmed. For BRAZIL: B→C, R→S, A→B, Z(26)+1=A (wrap-around), I→J, L→M → CSBAJM. The Z→A wrap is the trap. Answer: Option A.
Why this question: Reinforces +1 shift pattern — a quick confidence-builder that you should solve in under 30 seconds.
Solving path: P(16)+1=Q ✓, E(5)+1=F ✓ — confirmed +1 shift. For CAR: C(3)+1=D, A(1)+1=B, R(18)+1=S → DBS. Answer: Option A.
Why this question: A +2 shift with wrap-around (Y→A). Tests whether you handle the circular alphabet correctly for non-Z boundary letters.
Solving path: F(6)+2=H(8) ✓, A(1)+2=C(3) ✓ — shift is +2. For SISTER: S(19)+2=U, I(9)+2=K, S(19)+2=U, T(20)+2=V, E(5)+2=G, R(18)+2=T → UKUVGT. Answer: Option A.
Why this question: Position-number code (A=1...Z=26) — a completely different question type that needs instant recognition.
Solving path: Recognize the numeric format immediately. Verify: F=6 ✓, L=12 ✓ — standard A=1 position scheme. For GARDEN: G=7, A=1, R=18, D=4, E=5, N=14 → 7-1-18-4-5-14. Answer: Option A.
Why this question: Tests uniform +2 shift recognition when the coding word uses consistent +2 mapping — verify quickly and apply.
Solving path: Verify the +2 shift logic as indicated by the explanation. For CANVAS: C(3)+2=E, A(1)+2=C, N(14)+2=P, V(22)+2=X, A(1)+2=C, S(19)+2=U → ECPXCU. Answer: Option A.
Forgetting wrap-around at Z. The single most costly error. When a +k shift pushes you past Z (position 26), you must subtract 26, not stop at Z or write something nonsensical. Z+1=A, not "AA" or "27". Always ask yourself: "Does this letter's shift cross 26?" if the letter is in the W–Z range.
Assuming the shift is always positive (forward). Some questions use a backward shift (negative d). If your computed shift gives you a negative difference (e.g., coded letter comes earlier in the alphabet than the original), the shift is backward. Confirm with one more letter before applying.
Using A=1 when the question uses A=26 reverse. When numbers feel "too large" for standard positions (like A appearing as 26), pause and check whether the sum of standard + coded position = 27. If yes, it is a reverse scheme.
Applying the shift to the wrong direction when reversing a word. Some questions reverse the word first (MANGO → OGNAM) and then apply a shift. If standard shift does not work on the original word, try reversing the given word and then applying the shift. Candidates who skip this step waste 30–40 seconds trying random shifts.
Cross-contaminating codes in mixed-word problems. In substitution (sentence-based) questions, candidates sometimes assign a code to the wrong word because they did not systematically isolate the unique word first. Always start with the word that appears in only one sentence.
Not verifying with a second letter before applying. Verifying with only the first letter and then applying a wrong rule to 4–5 letters of the answer word is a 45-second mistake. Two-letter verification costs 5 seconds and saves you from that trap.