Runtime: 102 ms (Top 73.77%) | Memory: 44.2 MB (Top 95.08%)

Author: AnasImloul

scripts/algorithms/S/Shortest Completing Word/Shortest Completing Word.js

@@ -1,30 +1,31 @@
+// Runtime: 102 ms (Top 73.77%) | Memory: 44.2 MB (Top 95.08%)
 var shortestCompletingWord = function(licensePlate, words) {
-    
+
     // Object to hold the shortest word that matches
     var match = {'found':false, 'word':''};
-    
+
     // Char array to hold the upper case characters we want to match
     var licensePlateChars = licensePlate.toUpperCase().replace(/[^A-Z]/g, '').split('');
-    
+
     words.forEach(function (word) {
         // if we already have a match make sure that the word we are checking is shorter
         if (!match.found || word.length < match.word.length) {
             var replaceWord = word.toUpperCase();
-            
+
             // Loop over each character in the license plate and replace one at a time
             // the key here is that replace will only replace 1 S even if there are 2
             licensePlateChars.forEach(function (lChar) {
                 replaceWord = replaceWord.replace(lChar, '');
             });
-            
-            // We know the word works if the length of the word minus 
+
+            // We know the word works if the length of the word minus
             // the length of chars equals the length of the new word
             if (word.length - licensePlateChars.length === replaceWord.length) {
                 match.found = true;
                 match.word = word
             }
         }
     });
-    
+
     return match.word;
-};
+};