← All problemsSign in

1307. Verbal Arithmetic Puzzle

LeetCodeArrayMathStringBacktrackingOpen on judge ↗

Given an equation, represented by words on the left side and the result on the right side. You need to check if the equation is solvable under the following rules: - Each character is decoded as one digit (0 - 9). - No two characters can map to the same digit. - Each words[i] and result are decoded as one number without leading zeros. - Sum of numbers on the left side (words) will equal to th

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start