# 1880. Check if Word Equals Summation of Two Words

## Description

The letter value of a letter is its position in the alphabet starting from 0 (i.e. 'a' -> 0, 'b' -> 1, 'c' -> 2, etc.).

The numerical value of some string of lowercase English letters s is the concatenation of the letter values of each letter in s, which is then converted into an integer.

• For example, if s = "acb", we concatenate each letter's letter value, resulting in "021". After converting it, we get 21.

You are given three strings firstWord, secondWord, and targetWord, each consisting of lowercase English letters 'a' through 'j' inclusive.

Return true if the summation of the numerical values of firstWord and secondWord equals the numerical value of targetWord, or false otherwise.

Example 1:

Input: firstWord = "acb", secondWord = "cba", targetWord = "cdb"
Output: true
Explanation:
The numerical value of firstWord is "acb" -> "021" -> 21.
The numerical value of secondWord is "cba" -> "210" -> 210.
The numerical value of targetWord is "cdb" -> "231" -> 231.
We return true because 21 + 210 == 231.


Example 2:

Input: firstWord = "aaa", secondWord = "a", targetWord = "aab"
Output: false
Explanation:
The numerical value of firstWord is "aaa" -> "000" -> 0.
The numerical value of secondWord is "a" -> "0" -> 0.
The numerical value of targetWord is "aab" -> "001" -> 1.
We return false because 0 + 0 != 1.


Example 3:

Input: firstWord = "aaa", secondWord = "a", targetWord = "aaaa"
Output: true
Explanation:
The numerical value of firstWord is "aaa" -> "000" -> 0.
The numerical value of secondWord is "a" -> "0" -> 0.
The numerical value of targetWord is "aaaa" -> "0000" -> 0.
We return true because 0 + 0 == 0.


Constraints:

• 1 <= firstWord.length, secondWord.length, targetWord.length <= 8
• firstWord, secondWord, and targetWord consist of lowercase English letters from 'a' to 'j' inclusive.

## Solutions

• class Solution {
public boolean isSumEqual(String firstWord, String secondWord, String targetWord) {
return f(firstWord) + f(secondWord) == f(targetWord);
}

private int f(String s) {
int res = 0;
for (char c : s.toCharArray()) {
res = res * 10 + (c - 'a');
}
return res;
}
}

• class Solution {
public:
bool isSumEqual(string firstWord, string secondWord, string targetWord) {
return f(firstWord) + f(secondWord) == f(targetWord);
}

int f(string s) {
int res = 0;
for (char c : s) res = res * 10 + (c - 'a');
return res;
}
};

• class Solution:
def isSumEqual(self, firstWord: str, secondWord: str, targetWord: str) -> bool:
def f(s):
res = 0
for c in s:
res = res * 10 + (ord(c) - ord('a'))
return res

return f(firstWord) + f(secondWord) == f(targetWord)


• func isSumEqual(firstWord string, secondWord string, targetWord string) bool {
f := func(s string) int {
res := 0
for _, c := range s {
res = res*10 + int(c-'a')
}
return res
}
return f(firstWord)+f(secondWord) == f(targetWord)
}

• function isSumEqual(firstWord: string, secondWord: string, targetWord: string): boolean {
const calc = (s: string) => {
let res = 0;
for (const c of s) {
res = res * 10 + c.charCodeAt(0) - 'a'.charCodeAt(0);
}
return res;
};
return calc(firstWord) + calc(secondWord) === calc(targetWord);
}


• /**
* @param {string} firstWord
* @param {string} secondWord
* @param {string} targetWord
* @return {boolean}
*/
var isSumEqual = function (firstWord, secondWord, targetWord) {
function f(s) {
let res = 0;
for (let c of s) {
res = res * 10 + (c.charCodeAt() - 'a'.charCodeAt());
}
return res;
}
return f(firstWord) + f(secondWord) == f(targetWord);
};


• impl Solution {
fn calc(s: &String) -> i32 {
let mut res = 0;
for c in s.as_bytes() {
res = res * 10 + ((c - b'a') as i32);
}
res
}

pub fn is_sum_equal(first_word: String, second_word: String, target_word: String) -> bool {
Self::calc(&first_word) + Self::calc(&second_word) == Self::calc(&target_word)
}
}