There is a standard keyboard layout with $3$ rows of lowercase English letters:

• Row $0$: "qwertyuiop"

• Row $1$: "asdfghjkl"

• Row $2$: "zxcvbnm"

Each letter is located at a coordinate $(r, c)$, where $r$ is the $0$ indexed row number and $c$ is the $0$ indexed column number within that row.

You start with your finger positioned at the letter 'a' at coordinate $(1, 0)$. To type a character, you move your finger from its current position $(r_1, c_1)$ to the target key’s position $(r_2, c_2)$. The distance of this movement is the Manhattan distance, defined as $|r_1 - r_2| + |c_1 - c_2|$.

Given a string s, return the total distance traveled to type all characters in s in sequence using one finger.

Constraints:

• $1 \leq$ s.length $\leq 10^4$

• s consists of lowercase English letters only.

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.