Problem: Shift Distance Between Two Strings

Try to solve the Shift Distance Between Two Strings problem.

Statement

You are given two strings s and t of the same length, along with two integer arrays nextCost and previousCost of length $26$ .

In one operation, you can transform a character at index i of s into:

The next character in alphabetical order, wrapping around from 'z' to 'a'. The cost of shifting character $c$ to its next character is nextCost[c], where $c$ represents the index of the character from $0$ for 'a' to $25$ for 'z'.
The previous character in alphabetical order, wrapping around from 'a' to 'z'. The cost of shifting character $c$ to its previous character is previousCost[c], where $c$ represents the index of the character from $0$ for 'a' to $25$ for 'z'.

The shift distance from s to t is the sum of the minimum costs required to convert each s[i] to t[i] for all valid indices i.

Return an integer representing the minimum shift distance to transform s into t.

Constraints:

Try to solve the Shift Distance Between Two Strings problem.

You are given two strings s and t of the same length, along with two integer arrays nextCost and previousCost of length $26$ .

In one operation, you can transform a character at index i of s into:

The next character in alphabetical order, wrapping around from 'z' to 'a'. The cost of shifting character $c$ to its next character is nextCost[c], where $c$ represents the index of the character from $0$ for 'a' to $25$ for 'z'.
The previous character in alphabetical order, wrapping around from 'a' to 'z'. The cost of shifting character $c$ to its previous character is previousCost[c], where $c$ represents the index of the character from $0$ for 'a' to $25$ for 'z'.

The shift distance from s to t is the sum of the minimum costs required to convert each s[i] to t[i] for all valid indices i.

Return an integer representing the minimum shift distance to transform s into t.

Constraints: