Consider a keyboard where the $26$ uppercase English letters are arranged in a grid with $6$ columns:

• $'A'$ is at $(0, 0)$, $'B'$ is at $(0, 1)$, …, $'F'$ is at $(0, 5)$

• $'G'$ is at $(1, 0)$, $'H'$ is at $(1, 1)$, …, $'L'$ is at $(1, 5)$

• and so on, with $'Z'$ located at $(4, 1)$.

The distance between two coordinates $(x_1, y_1)$ and $(x_2, y_2)$ is defined as $|x_1 - x_2| + |y_1 - y_2|$.

You are given a string word. You start with two fingers placed at any position on the keyboard at no initial cost. Moving a finger from its current letter position to a new letter position incurs a cost equal to the distance between the two letters.

Return the minimum total distance required to type all the characters in word in order.

Constraints:

• $2 \leq$ word.length $\leq 300$

• word consists of uppercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.