Question

In a game, a "word" is any combination of at least five letters of the English alphabet (the word does not have to have a meaning). A "sentence" in this game consists of exactly six such words, and it must satisfy all of the following rules:
1. The six words are written from left to right on a single line, in strictly increasing alphabetical order.
2. The sentence may start with any word. Each successive word is obtained from the word right before it by applying exactly ONE of three operations: deleting one letter, adding one letter, or replacing one letter with another letter.
3. At most three of the six words can begin with the same letter.
4. Apart from the first word, every word must be formed using an operation different from the one used to form the word immediately before it (so the same operation can never be used twice in a row).

Which one of the following could be a sentence in the word game?

• A. Bzaeak, blaeak, laeak, paeak, paea, paean
• B. Crobek, croeek, roeek, soeek, sxoeek, xoeek
• C. Doteam, goleam, golean, olean, omean, omman
• D. Feted, freted, reted, seted, seteg, aseteg

Hint:

Check each option against all four rules together (alphabetical order, one edit per step, no repeated edit type, and a cap of three same-starting-letter words) - most options fall on just one of these checks.

Answer 1

The Correct Option is B

This question is really an exercise in pattern-checking: a valid "sentence" here is a chain of six words where each link obeys three separate checks at once - alphabetical climb, a single letter-level edit, and no repeated edit type twice running, plus an overall cap of three words sharing a first letter. Instead of hunting for the right answer directly, it helps to build a small table of "from word to word: what changed?" for each option and see where it breaks.

1. Bzaeak, blaeak, laeak, paeak, paea, paean: building the word-to-word table, the very first row already fails, because moving from "Bzaeak" to "blaeak" goes backward alphabetically (a "z" word cannot be followed by an earlier "l" word). No need to check the rest of the chain.
2. Crobek, croeek, roeek, soeek, sxoeek, xoeek: the table reads replace(b to e), delete(cc), replace(r to s), add(xx), delete(ss). Every row is alphabetically ahead of the last, every move is a single-letter edit, and no edit type repeats two rows running. The starting letters are C, C, r, s, s, x, so nothing exceeds the three-word cap. This chain clears every check.
3. Doteam, goleam, golean, olean, omean, omman: the first move alone needs the first letter and the third letter to change together ("Doteam" to "goleam"), which is two edits disguised as one. That is not a legal single operation, so this chain fails on the very first move.
4. Feted, freted, reted, seted, seteg, aseteg: tracing the table gives add(rr), delete(ff), replace(r to s), replace(d to g), add(aa). The fourth and fifth rows are both "replace", which repeats the same edit type back to back. That breaks the no-repeat rule.

Option (EE), "Forod, forol, forols, forpls, orpls, morpls", also needs a separate check: its first four words, Forod, forol, forols, forpls, all begin with the letter "f", four words sharing one starting letter. Since the cap is three, this chain is disqualified even though its edit-table looks fine.

Let's summarize:

• Only the "Crobek..." chain keeps every word alphabetically ahead of the last one.
• Only the "Crobek..." chain uses a genuine single-letter edit at every step, with no two neighbouring edits of the same type.
• Only the "Crobek..." chain keeps every starting letter to at most three repeats.

So the sentence that fits the word game is "Crobek, croeek, roeek, soeek, sxoeek, xoeek", which is option (BB).