solves shortest completing word

Author: anishLearnsToCode

README.md

@@ -1,8 +1,8 @@
 # LeetCode Algorithms
 
-![problems-solved](https://img.shields.io/badge/Problems%20Solved-182/2081-1f425f.svg)
-![problems-solved-java](https://img.shields.io/badge/Java-182/2081-1abc9c.svg)
-![problems-solved-python](https://img.shields.io/badge/Python-182/2081-1abc9c.svg)
+![problems-solved](https://img.shields.io/badge/Problems%20Solved-183/2081-1f425f.svg)
+![problems-solved-java](https://img.shields.io/badge/Java-183/2081-1abc9c.svg)
+![problems-solved-python](https://img.shields.io/badge/Python-183/2081-1abc9c.svg)
 [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](CONTRIBUTING.md)
 [![cp](https://img.shields.io/badge/also%20see-Competitve%20Programming-1f72ff.svg)](https://github.com/anishLearnsToCode/competitive-programming)
 
@@ -206,7 +206,7 @@
 | 744 | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | [![Java](assets/java.png)](src/FindSmallestLetterGreaterThanTarget.java) [![Python](assets/python.png)](python/find_smallest_letter_greater_than.py) |
 | 746 | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | [![Java](assets/java.png)](src/MinCostClimbingStairs.java) [![Python](assets/python.png)](python/min_cost_climbing_stairs.py) |
 | 747 | [Largest Number at least twize of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | [![Java](assets/java.png)](src/LargestNumberAtLeastTwiceOfOthers.java) [![Python](assets/python.png)](python/largest_number_at_least_twice_of_others.py) |
-| 748 | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | |
+| 748 | [Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word) | [![Java](assets/java.png)](src/ShortestCompletingWord.java) [![Python](assets/python.png)](python/shortest_completing_word.py) |
 | 758 | [Bold Words in String](https://leetcode.com/problems/bold-words-in-string) | |
 | 760 | [Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) | |
 | 762 | [Prime Number of Set Bits in Primary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | |

python/shortest_completing_word.py

@@ -0,0 +1,31 @@
+from typing import List
+
+
+class Solution:
+    def __init__(self):
+        self.primes = [
+            2,  3,  5,  7, 11, 13, 17, 19, 23, 29, 31, 37,  41,
+            43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101
+    ]
+
+    def shortestCompletingWord(self, licensePlate: str, words: List[str]) -> str:
+        licenseHash = self.getHash(licensePlate)
+        resultIndex, shortestLen = -1, float('inf')
+        for index, word in enumerate(words):
+            if len(word) < shortestLen and self.coversAllChars(word, licenseHash):
+                resultIndex = index
+                shortestLen = len(word)
+        return words[resultIndex]
+
+    def getHash(self, string: str) -> int:
+        result = 1
+        for char in string.lower():
+            if char.isalpha():
+                result *= self.primes[ord(char) - ord('a')]
+        return result
+
+    def coversAllChars(self, word: str, hash: int) -> bool:
+        result = 1
+        for character in word:
+            result = (result * self.primes[ord(character) - ord('a')]) % hash
+        return result == 0

src/ShortestCompletingWord.java

@@ -0,0 +1,37 @@
+public class ShortestCompletingWord {
+    private final int[] primes = {
+            2,  3,  5,  7, 11, 13, 17, 19, 23, 29, 31, 37,  41,
+            43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101
+    };
+
+    public String shortestCompletingWord(String licensePlate, String[] words) {
+        long licenseHash = getHash(licensePlate);
+        int shortestCompletingWordLen = Integer.MAX_VALUE;
+        int shortestWordIndex = -1;
+        for (int index = 0 ; index < words.length ; index++) {
+            if (words[index].length() < shortestCompletingWordLen && containsAllChars(words[index], licenseHash)) {
+                shortestCompletingWordLen = words[index].length();
+                shortestWordIndex = index;
+            }
+        }
+        return words[shortestWordIndex];
+    }
+
+    private long getHash(String string) {
+        long result = 1;
+        for (char character : string.toLowerCase().toCharArray()) {
+            if (Character.isAlphabetic(character)) {
+                result *= primes[character - 'a'];
+            }
+        }
+        return result;
+    }
+
+    private boolean containsAllChars(String word, long hash) {
+        long result = 1;
+        for (char character : word.toCharArray()){
+            result = (result * primes[character - 'a']) % hash;
+        }
+        return result == 0;
+    }
+}