Alphabet series questions give you a sequence of letters, pairs, or triplets — and ask you to find the missing piece. The underlying logic is always some consistent rule applied across positions. That rule is almost always one of three things: a fixed jump between consecutive letters, a variable jump that follows a pattern itself, or a structural rule governing the shape of each group.
Here is the key mental shift: stop treating letters as symbols and start treating them as numbers. Every letter has a fixed position in the English alphabet. Once you internalize this, every series becomes a number pattern in disguise.
The standard position table you need at your fingertips:
| 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 | | | | |
Think of the alphabet as a circular track — after Z (26) comes A (1) again, with wrap-around. This wrap-around feature trips up more candidates than any other element of these questions.
An analogy that works: imagine the alphabet as a clock face stretched from 1 to 26. Each series is a set of jumps around that clock. Your job is to figure out the jump size and direction — then apply it to find the missing position.
The question format for UP Police Constable typically falls into:
All four types share the same solve process — extract positions, identify the jump pattern, apply it.
The moment you see a letter series, write position numbers immediately. Do not try to "see" the pattern with eyes alone. Candidates who skip this step lose 30 seconds per question fixing wrong answers.
Example: B, E, H, K, ? Positions: 2, 5, 8, 11, ? Differences: +3, +3, +3 — next is 14 = N
That took four seconds. No guesswork.
Fixed jump: Differences between consecutive positions are constant.
Variable jump: The differences themselves form a pattern.
Structural/group pattern: Each group (pair or triplet) is internally structured, and each group advances by a rule.
This is the most common format in UP Police Constable — don't get rattled by triplets. Break each position separately.
When a position calculation exceeds 26 or goes below 1:
Alternatively, use modular thinking: position mod 26 (treating 26 as Z, not 0).
For pair series, each track is independent. Track the first letter separately, track the second letter separately.
Example from PYQ: ZA, ?, VE, TG
This two-track approach prevents the most common error — mixing up which letter belongs to which track.
Some triplet series have an internal structure: each triplet is three consecutive letters in reverse order.
Once you spot the "reverse consecutive" structure, you only need to find where the next triplet starts.
Four reference points cut your conversion time in half:
When a series has a term near J or T, you can count forward/backward from those anchors instead of counting from A every time.
Memorize: E=5, J=10, O=15, T=20, Y=25. These are every 5th letter. From any of these anchors, add or subtract small numbers to reach any letter fast. Finding position of R? T=20, R is 2 before T, so R=18. Finding position of W? Y=25, W is 2 before Y, so W=23. Standard counting-from-A method: 6–8 seconds. EJOTY anchor method: 2–3 seconds.
For any pair or triplet series, draw two (or three) horizontal rows. Row 1: all first-position letters as numbers. Row 2: all second-position letters as numbers. Row 3: all third-position letters as numbers. Then solve each row as an independent number series. This prevents cross-track confusion and reduces solve time from ~60s (visual approach) to ~25s (tabulated approach). The 5-mock average shows candidates who tabulate get 90%+ accuracy on triplet questions; visual-only approach yields ~60% accuracy.
When a position goes above 26: subtract 26 once. When it goes below 1: add 26 once. In 99% of exam series, you will never need to subtract or add 26 more than once. So skip modular arithmetic altogether — just apply ±26 once. Example: Z(26) + 3 = 29 → 29−26 = 3 = C. Standard confusion+recount: 15 seconds. Direct ±26 rule: 3 seconds.
When each triplet is consecutive letters in reverse (like CBA, GFE, KJI), all you need is the jump between the first letters of each triplet. Count: C→G = +4, G→K = +4. Next triplet starts at K+4 = O. Then write: O, N, M → ONM. You skip decoding the second and third letters individually. This cuts a 3-step decode into a 1-step decode: saves approximately 20 seconds per question.
When fixed-jump check fails (differences are not all equal), immediately check if the differences themselves form an arithmetic sequence: +1,+2,+3,+4 or +2,+3,+4 or +1,+3,+5 (odd numbers). Write out the differences as a secondary row below your position row. If that row is arithmetic, next difference = current + 1 (or whatever the arithmetic step is). Example: LA, MC, OF, RJ — first letters L(12), M(13), O(15), R(18). Differences: +1, +2, +3. Next difference = +4. R(18)+4 = 22 = V. Verified against answer VO.
In the exam hall, use this four-step decision tree:
1. Single letters or groups? Single letters → go straight to position-difference method. Groups (pairs/triplets) → split into tracks first.
2. Fixed or variable jump? Write differences. If all equal → fixed jump, apply directly. If not equal → check if differences are arithmetic (increasing/decreasing by constant). If yes → variable jump, find next difference.
3. Does it involve a structural rule? If triplets look like consecutive reversed letters → use reverse-triplet start-point method. If triplets have independent up/down tracks → solve each track separately.
4. Does the answer wrap around Z? If your calculated position > 26, subtract 26. If < 1, add 26.
Pick one option that matches. If two options share the same letter in position 1, differentiate by solving track 2. Never guess without solving both tracks — that is where the trap options live.
Time target: 40–60 seconds per letter series question. If you hit 90 seconds, you are doing visual parsing instead of numerical tabulation. Shift method.
Why this question: ZA, ?, VE, TG tests the core two-track pair series skill that recurs across multiple years. If you get confused by which letter to track, this one corrects that habit.
Solving path: Convert pairs to position rows. Track 1 (first letters): Z=26, ?, V=22, T=20. Differences going forward: 22−26=−4... wait — read left to right: 26, ?, 22, 20. Differences: 22−26=−4 seems off. Recalculate: Z,?,V,T with gaps between each. Z to V is −4 over two steps → −2 per step. So Z(26) → X(24) → V(22) → T(20). Missing = X. Track 2 (second letters): A=1, ?, E=5, G=7. Differences: +2 per step. A(1) → C(3) → E(5) → G(7). Missing = C. Answer: XC. Option 3.
Why this question: CBZ, FEW, IHT tests the triplet-with-mixed-direction pattern — first two letters go up, third goes down. Common trap: applying same direction to all three tracks.
Solving path: Three tracks. Track 1: C(3), F(6), I(9), ? → +3 each → L(12). Track 2: B(2), E(5), H(8), ? → +3 each → K(11). Track 3: Z(26), W(23), T(20), ? → −3 each → Q(17). Answer: LKQ. Option 1.
Why this question: CBA, GFE, KJI, ONM, SRQ tests whether you notice the internal reverse-consecutive structure. Candidates who miss this structure spend time computing three separate tracks unnecessarily.
Solving path: Each triplet = three consecutive letters in reverse. First letters: C(3), G(7), K(11), O(15), S(19) → +4 each → W(23). So next triplet starts at W and goes W, V, U. Answer: WVU. Option 4.
Why this question: LHD, OJF, RLH, ____, XPL, ARN tests a multi-track pattern where each track has a different jump size. The trap option UMJ has the wrong second letter.
Solving path: Track 1: L(12), O(15), R(18), ?, X(24), A(27→1) → +3 each → U(21). Track 2: H(8), J(10), L(12), ?, P(16), R(18) → +2 each → N(14). Track 3: D(4), F(6), H(8), ?, L(12), N(14) → +2 each → J(10). Answer: UNJ. Option 3. (Note: UMJ uses M=13 which would be +3 on track 2 — wrong because track 2 jumps +2.)
Why this question: LA, MC, OF, RJ, ?, AU tests variable jumps on both tracks simultaneously — the hardest single-pair format. This is the question that separates candidates who write differences from those who eyeball.
Solving path: Track 1: L(12), M(13), O(15), R(18), ?, A(1 with wrap). Differences: +1, +2, +3 → next = +4 → R(18)+4 = V(22). Track 2: A(1), C(3), F(6), J(10), ?, U(21). Differences: +2, +3, +4 → next = +5 → J(10)+5 = O(15). Answer: VO. Option 2. Wrap check for Track 1: V+5 = 27 → 27−26 = 1 = A. Confirmed the last term A is correct, validating our pattern.
Mixing up tracks in pair/triplet series. You compute the first letter correctly, then accidentally apply that same jump to the second letter. Always draw horizontal rows — one per track — before computing anything.
Forgetting wrap-around at Z. Z+1 is A, not some undefined letter. If your answer lands outside A-Z, you must apply the ±26 correction. This alone causes 1-2 wrong answers per mock for candidates who skip it.
Assuming all tracks jump in the same direction. In CBZ → FEW → IHT, tracks 1 and 2 go up (+3) while track 3 goes down (−3). Do not assume uniformity. Check each track independently.
Confusing "reverse consecutive" triplets with independent tracks. CBA is C,B,A — consecutive in reverse. Once you spot this, you only need the starting letter's jump. Treating it as three independent tracks adds unnecessary computation and invites error.
Reading variable jumps wrong. Variable jumps (+1,+2,+3...) are differences between terms, not the terms themselves. Write the position row first, then write the differences row below it. Never try to spot variable jumps without writing out differences explicitly.
Using the wrong anchor for EJOTY. E=5, J=10, O=15, T=20, Y=25. Double-check: O is the 15th letter (count: A,B,C,D,E,F,G,H,I,J,K,L,M,N,O = 15). Getting O=14 or O=16 by miscounting is a common speed-induced error. Memorize EJOTY as a five-part single unit, not by counting from A each time.