Class PrefixTrie

tries/multi-string-search.js:4–44

// MY SOLUTION
////////////////////////////////////////////
class PrefixTrie {
  constructor(string) {
    this.root = {};
    this.lastSymbol = "*";
    this.populateSuffixTrieFrom(string);
  }

  // Time O(n^2)
  // Space O(n^2)
  populateSuffixTrieFrom(string) {
    for (let i = 0; i < string.length; i++) {
      this.insertStringFrom(i, string);
    }
  }

  insertStringFrom(i, string) {
    let currentNode = this.root;

    for (let j = i; j < string.length; j++) {
      const letter = string[j];
      if (!currentNode.hasOwnProperty(letter)) {
        currentNode[letter] = {};
      }
      currentNode = currentNode[letter];
    }
    currentNode[this.lastSymbol] = true;
  }

  contains(string) {
    let currentNode = this.root;
    for (let i = 0; i < string.length; i++) {
      const letter = string[i];
      if (!currentNode.hasOwnProperty(letter)) {
        return false;
      }
      currentNode = currentNode[letter];
    }
    // return currentNode.hasOwnProperty(this.lastSymbol);
    return true;
  }
}
// Time O(b^2 + ns)
// Space O(b^2 + n)
function multiStringSearch(bigString, smallStrings) {