In the word **'OBSEQUIOUS'**, how many pairs of letters have the same number of letters between them in the word (both forward and backward) as they do in the alphabetical series?

Question

Accepted Answer

**Solution:**

1. Write down the word: **O B S E Q U I O U S**

2. Assign positions to each letter in the word (index starting from 1):
   - O(1), B(2), S(3), E(4), Q(5), U(6), I(7), O(8), U(9), S(10)

3. Check pairs of letters and count the number of letters between them in the word.

4. For each pair, find the number of letters between them in the alphabetical order.

5. Compare the two counts (in the word and in the alphabet). If they are equal, count that pair.

6. After checking all possible pairs, it is found that **three** such pairs satisfy the condition.

**Answer:** Three

Answer

Answer

Answer

Answer