Repository navigation
Day 250 #516
Description
Good morning! Here's your coding interview problem for today.
This problem was asked by Google.
A cryptarithmetic puzzle is a mathematical game where the digits of some numbers are represented by letters. Each letter represents a unique digit.
For example, a puzzle of the form:
SEND
+ MORE
--------
MONEY
may have the solution:
{'S': 9, 'E': 5, 'N': 6, 'D': 7, 'M': 1, 'O', 0, 'R': 8, 'Y': 2}
Given a three-word puzzle like the one above, create an algorithm that finds a solution.
Metadata
Metadata
Assignees
Labels
No labels
Activity
vaskoz commentedon May 4, 2019
Multiple solutions are possible, but I made my solver deterministic.
So for the example above:
My answer is:
It always returns this solution to that problem. The algorithm does a brute force search by assigning digits to the lexicographically smallest runes first.
Solution is: