#1307

Verbal Arithmetic Puzzle

master · 1870 · lc hard +32 · verified · 34.9% accepted · 528 likes · top 13%

⚑ Constraint Satisfaction (Sudoku / N-Queens)

Description

You have a verbal arithmetic equation where each letter stands for a unique digit (0–9). The left side is the sum of the decoded words; the right side is the decoded result. No word may have a leading zero.

Return true if there exists a digit assignment that makes the equation hold, otherwise return false.

Example 1:

Input: words = ["SEND","MORE"], result = "MONEY"

Output: true

Explanation: Map 'S'-> 9, 'E'->5, 'N'->6, 'D'->7, 'M'->1, 'O'->0, 'R'->8, 'Y'->'2'

Such that: "SEND" + "MORE" = "MONEY" , 9567 + 1085 = 10652

Example 2:

Input: words = ["SIX","SEVEN","SEVEN"], result = "TWENTY"

Output: true

Explanation: Map 'S'-> 6, 'I'->5, 'X'->0, 'E'->8, 'V'->7, 'N'->2, 'T'->1, 'W'->'3', 'Y'->4

Such that: "SIX" + "SEVEN" + "SEVEN" = "TWENTY" , 650 + 68782 + 68782 = 138214

Example 3:

Input: words = ["LEET","CODE"], result = "POINT"

Output: false

Explanation: There is no possible mapping to satisfy the equation, so we return false.

Note that two different characters cannot map to the same digit.

Code

1

2

3

class Solution:
    def isSolvable(self, words: List[str], result: str) -> bool:

class Solution:
    def isSolvable(self, words: List[str], result: str) -> bool: