If the number of distinct letters exceeds 10 there is no solution, because different letters map to different digits. Otherwise brute-force all injections of the 10 digits into the $k$ letters. A mapping satisfying the equation is a solution; if none works, none exists. Number of assignments:

where $k$ is the number of distinct letters.