You are given a $0$ indexed string s consisting of lowercase English letters, where every letter present in s appears exactly twice. You are also given a $0$ indexed integer array distance of length $26$.

The alphabetical letters are mapped to indices from $0$ to $25$ (that is, 'a' corresponds to $0$, 'b' corresponds to $1$, and so on, up to 'z' which corresponds to $25$).

A string s is considered well spaced if, for every letter that appears in s, the number of characters strictly between its two occurrences is equal to distance[i], where i is the $0$ indexed alphabetical position of that letter. If a letter does not appear in s, its corresponding value in distance can be ignored.

Return true if s is a well spaced string, otherwise return false.

Constraints:

• $2 \leq$ s.length $\leq 52$

• s consists only of lowercase English letters.

• Each letter appears in s exactly twice.

• distance.length $= 26$

• $0 \leq$ distance[i] $\leq 50$

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.