How should I practice Minimum Adjacent Transpositions?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Epic online assessment problems in FastPrep.

Is Minimum Adjacent Transpositions associated with Epic?

FastPrep tags this as a Epic online assessment coding practice problem when the problem catalog has that company and stage context.

Problem · String

Minimum Adjacent Transpositions

Learn this problem

● Medium

EpicFULLTIMEOA

Problem statement

source and target contain the same ASCII characters with the same frequencies.

In one operation, swap two adjacent characters in source. Return the minimum number of operations required to transform source into target.

Function

minimumAdjacentSwaps(source: String, target: String) → long

Examples

Example 1

source = "GUM"target = "MUG"return = 3

Moving M to the front takes two swaps, then moving U ahead of G takes one more.

Example 2

source = "aabb"target = "bbaa"return = 4

Each of the two b characters crosses both a characters.

Constraints

1 <= source.length == target.length <= 200000
Both strings contain the same ASCII characters with the same frequencies.