Neighboring permutation of letters in the string

Hello

Looking for an algorithm that calculates the number of necessary permutations of a string A to string B.
But the main idea is that you can only swap adjacent letters.

Please help.

Yours diox