If the letters of the word RAMAKRISHNA are rearranged according to English alphabetical order, how many letters will remain in the same position after the rearrangement?

Let's align the original index positions of the letters in the word RAMAKRISHNA next to its sorted alphabetical variation.
Original string configuration:

$$\text{R — A — M — A — K — R — I — S — H — N — A}$$

Let's count letter occurrences to list them alphabetically: $\text{A (3), H (1), I (1), K (1), M (1), N (1), R (2), S (1)}$.
Sorted arrangement:

$$\text{A — A — A — H — I — K — M — N — R — R — S}$$

Comparing the characters column-by-column across indices:

1. R vs A
2. A vs A (Matches!)
3. M vs A
4. A vs H
5. K vs I
6. R vs K
7. I vs M
8. S vs N
9. H vs R
10. N vs R
11. A vs S

Only the letter 'A' at index 2 holds the exact same positional slot before and after sorting. Thus, only $1$ letter remains unchanged.