Given a string s consisting of lowercase English letters, determine if s can be split into two non empty substrings such that the score of the left substring is equal to the score of the right substring.

The score of a character corresponds to its $1$ based alphabetical position, where 'a' has a score of $1$, 'b' has a score of $2$, and continuing up to 'z' with a score of $26$. The score of a substring is defined as the sum of the scores of all its characters.

Return true if such a split exists, and false otherwise.

Constraints:

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

• s consists of lowercase 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.