Available question text
Map each letter 'a'..'j' to digits 0..9, form each word's numerical value by concatenating those digits and parsing as an integer, and check whether firstWord_value + secondWord_value equals targetWord_value. Inputs use only letters 'a'–'j' with length ≤ 8, so the resulting numbers fit comfortably in standard integer types.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1880. Check if Word Equals Summation of Two Words
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source