Leetcode 1880. Check if Word Equals Summation of Two Words

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1880. Check if Word Equals Summation of Two Words

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact