Available question text
Determine whether a cryptarithmetic equation can be satisfied by assigning distinct digits 0–9 to letters (no leading zeros) so that the numeric sum of the left-side words equals the result. With at most 10 unique letters, the problem reduces to a constraint-satisfaction/backtracking search (often solved with column-wise pruning) over digit assignments.
Related questions
Continue with questions that share topics or the same question type.
- Arithmetic Slices
Coding
- Arithmetic Slices II - Subsequence
Coding
- Arithmetic Subarrays
Coding
- Before and After Puzzle
Coding
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 1307. Verbal Arithmetic Puzzle
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source