Difficulty: Easy
Correct Answer: GFHJ
Explanation:
Introduction / Context:
Alphabetic sequence classification problems typically hide a fixed jump pattern (e.g., −1, +3, +1) across letters. Most options follow the same scheme; one does not. We compare letter-by-letter jumps using A=1, B=2, ..., Z=26 to verify consistency.
Given Data / Assumptions:
Concept / Approach:
Compute consecutive differences for each 4-letter string. For three options, the jump signature is −1, +3, +1. Any deviation from that signature indicates the odd one.
Step-by-Step Solution:
CBEF: C→B (−1), B→E (+3), E→F (+1).EDGH: E→D (−1), D→G (+3), G→H (+1).IHKL: I→H (−1), H→K (+3), K→L (+1).GFHJ: G→F (−1), F→H (+2), H→J (+2).Only GFHJ breaks the +3 then +1 pattern; it has +2 then +2.
Verification / Alternative check:
Translate to indices to eliminate ambiguity: C(3),B(2),E(5),F(6) → −1,+3,+1, etc. Do the same for each option to confirm the pattern uniqueness.
Why Other Options Are Wrong:
Common Pitfalls:
Spotting arcs like “down then up” is not enough—different up-steps (+2,+2 vs. +3,+1) can look similar at a glance. Always compute exact jumps.
Final Answer:
GFHJ
Discussion & Comments