LeetCode 1307. Verbal Arithmetic Puzzle Solution in Java, C++, Python & Go | Explanation + Code

Description

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 the number on the right side (result).

Return true if the equation is solvable, 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.

 

Constraints:

• 2 <= words.length <= 5
• 1 <= words[i].length, result.length <= 7
• words[i], result contain only uppercase English letters.
• The number of different characters used in the expression is at most 10.

Solutions

Solution 1

PythonJavaC++Go

class Solution: def isAnyMapping( self, words, row, col, bal, letToDig, digToLet, totalRows, totalCols ): # If traversed all columns. if col == totalCols: return bal == 0 # At the end of a particular column. if row == totalRows: return bal % 10 == 0 and self.isAnyMapping( words, 0, col + 1, bal // 10, letToDig, digToLet, totalRows, totalCols ) w = words[row] # If the current string 'w' has no character in the ('col')th index. if col >= len(w): return self.isAnyMapping( words, row + 1, col, bal, letToDig, digToLet, totalRows, totalCols ) # Take the current character in the variable letter. letter = w[len(w) - 1 - col] # Create a variable 'sign' to check whether we have to add it or subtract it. if row < totalRows - 1: sign = 1 else: sign = -1 # If we have a prior valid mapping, then use that mapping. # The second condition is for the leading zeros. if letter in letToDig and ( letToDig[letter] != 0 or (letToDig[letter] == 0 and len(w) == 1) or col != len(w) - 1 ): return self.isAnyMapping( words, row + 1, col, bal + sign * letToDig[letter], letToDig, digToLet, totalRows, totalCols, ) # Choose a new mapping. else: for i in range(10): # If 'i'th mapping is valid then select it. if digToLet[i] == "-" and ( i != 0 or (i == 0 and len(w) == 1) or col != len(w) - 1 ): digToLet[i] = letter letToDig[letter] = i # Call the function again with the new mapping. if self.isAnyMapping( words, row + 1, col, bal + sign * letToDig[letter], letToDig, digToLet, totalRows, totalCols, ): return True # Unselect the mapping. digToLet[i] = "-" if letter in letToDig: del letToDig[letter] # If nothing is correct then just return false. return False def isSolvable(self, words, result): # Add the string 'result' in the list 'words'. words.append(result) # Initialize 'totalRows' with the size of the list. totalRows = len(words) # Find the longest string in the list and set 'totalCols' with the size of that string. totalCols = max(len(word) for word in words) # Create a HashMap for the letter to digit mapping. letToDig = {} # Create a list for the digit to letter mapping. digToLet = ["-"] * 10 return self.isAnyMapping( words, 0, 0, 0, letToDig, digToLet, totalRows, totalCols )(code-box)

class Solution { private boolean isAnyMapping(List<String> words, int row, int col, int bal, HashMap<Character, Integer> letToDig, char[] digToLet, int totalRows, int totalCols) { // If traversed all columns. if (col == totalCols) { return bal == 0; } // At the end of a particular column. if (row == totalRows) { return (bal % 10 == 0 && isAnyMapping( words, 0, col + 1, bal / 10, letToDig, digToLet, totalRows, totalCols)); } String w = words.get(row); // If the current string 'w' has no character in the ('col')th index. if (col >= w.length()) { return isAnyMapping(words, row + 1, col, bal, letToDig, digToLet, totalRows, totalCols); } // Take the current character in the variable letter. char letter = w.charAt(w.length() - 1 - col); // Create a variable 'sign' to check whether we have to add it or subtract it. int sign = (row < totalRows - 1) ? 1 : -1; // If we have a prior valid mapping, then use that mapping. // The second condition is for the leading zeros. if (letToDig.containsKey(letter) && (letToDig.get(letter) != 0 || (letToDig.get(letter) == 0 && w.length() == 1) || col != w.length() - 1)) { return isAnyMapping(words, row + 1, col, bal + sign * letToDig.get(letter), letToDig, digToLet, totalRows, totalCols); } else { // Choose a new mapping. for (int i = 0; i < 10; i++) { // If 'i'th mapping is valid then select it. if (digToLet[i] == '-' && (i != 0 || (i == 0 && w.length() == 1) || col != w.length() - 1)) { digToLet[i] = letter; letToDig.put(letter, i); // Call the function again with the new mapping. if (isAnyMapping(words, row + 1, col, bal + sign * letToDig.get(letter), letToDig, digToLet, totalRows, totalCols)) { return true; } // Unselect the mapping. digToLet[i] = '-'; letToDig.remove(letter); } } } // If nothing is correct then just return false. return false; } public boolean isSolvable(String[] wordsArr, String result) { // Add the string 'result' in the list 'words'. List<String> words = new ArrayList<>(); for (String word : wordsArr) { words.add(word); } words.add(result); int totalRows = words.size(); // Find the longest string in the list and set 'totalCols' with the size of that string. int totalCols = 0; for (String word : words) { if (totalCols < word.length()) { totalCols = word.length(); } } // Create a HashMap for the letter to digit mapping. HashMap<Character, Integer> letToDig = new HashMap<>(); // Create a char array for the digit to letter mapping. char[] digToLet = new char[10]; for (int i = 0; i < 10; i++) { digToLet[i] = '-'; } return isAnyMapping(words, 0, 0, 0, letToDig, digToLet, totalRows, totalCols); } }(code-box)

class Solution { public: bool isAnyMapping(vector<string>& words, int row, int col, int bal, unordered_map<char, int>& letToDig, vector<char>& digToLet, int totalRows, int totalCols) { // If traversed all columns. if (col == totalCols) { return bal == 0; } // At the end of a particular column. if (row == totalRows) { return (bal % 10 == 0 && isAnyMapping(words, 0, col + 1, bal / 10, letToDig, digToLet, totalRows, totalCols)); } string w = words[row]; // If the current string 'W' has no character in the ('COL')th index. if (col >= w.length()) { return isAnyMapping(words, row + 1, col, bal, letToDig, digToLet, totalRows, totalCols); } // Take the current character in the variable letter. char letter = w[w.length() - 1 - col]; // Create a variable 'SIGN' to check whether we have to add it or subtract it. int sign; if (row < totalRows - 1) { sign = 1; } else { sign = -1; } /* If we have a prior valid mapping, then use that mapping. The second condition is for the leading zeros. */ if (letToDig.count(letter) && (letToDig[letter] != 0 || (letToDig[letter] == 0 && w.length() == 1) || col != w.length() - 1)) { return isAnyMapping(words, row + 1, col, bal + sign * letToDig[letter], letToDig, digToLet, totalRows, totalCols); } // Choose a new mapping. else { for (int i = 0; i < 10; i++) { // If 'i'th mapping is valid then select it. if (digToLet[i] == '-' && (i != 0 || (i == 0 && w.length() == 1) || col != w.length() - 1)) { digToLet[i] = letter; letToDig[letter] = i; // Call the function again with the new mapping. bool x = isAnyMapping(words, row + 1, col, bal + sign * letToDig[letter], letToDig, digToLet, totalRows, totalCols); if (x == true) { return true; } // Unselect the mapping. digToLet[i] = '-'; if (letToDig.find(letter) != letToDig.end()) { letToDig.erase(letter); } } } } // If nothing is correct then just return false. return false; } bool isSolvable(vector<string>& words, string result) { // Add the string 'RESULT' in the vector 'WORDS'. words.push_back(result); int totalRows; int totalCols; // Initialize 'TOTALROWS' with the size of the vector. totalRows = words.size(); // Find the longest string in the vector and set 'TOTALCOLS' with the size of that string. totalCols = 0; for (int i = 0; i < words.size(); i++) { // If the current string is the longest then update 'TOTALCOLS' with its length. if (totalCols < words[i].size()) { totalCols = words[i].size(); } } // Create a HashMap for the letter to digit mapping. unordered_map<char, int> letToDig; // Create a vector for the digit to letter mapping. vector<char> digToLet(10, '-'); return isAnyMapping(words, 0, 0, 0, letToDig, digToLet, totalRows, totalCols); } };(code-box)

(code-box)