Leetcode 1307. Verbal Arithmetic Puzzle

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.