The letter value of a letter is defined as its position in the alphabet starting from $0$ (that is, 'a' corresponds to $0$, 'b' corresponds to $1$, 'c' corresponds to $2$, and so on up to 'j' which corresponds to $9$).

The numerical value of a string of lowercase English letters is the integer formed by replacing each letter with its letter value and concatenating the digits in order.

Given three strings firstWord, secondWord, and targetWord, return true if the sum of the numerical values of firstWord and secondWord equals the numerical value of targetWord, or false otherwise.

Constraints:

• $1 \leq$ firstWord.length, secondWord.length, targetWord.length $\leq 8$

• firstWord, secondWord, and targetWord consist of lowercase English letters from 'a' to 'j' inclusive.

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.