Skip to content

Create 1268-search-suggestions-system.js #2624

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Sep 14, 2023
Merged

Create 1268-search-suggestions-system.js #2624

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
d6b3417
Create 1268-search-suggestions-system.js
aadil42 Jun 23, 2023
98ab2bc
Update 1268-search-suggestions-system.js
aadil42 Sep 14, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
46 changes: 46 additions & 0 deletions javascript/1268-search-suggestions-system.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,46 @@
/**
* Binary Search
*
* Time O(n*log(n) + m*n) | Space O(m)
* https://leetcode.com/problems/search-suggestions-system/description/
* @param {string[]} products
* @param {string} searchWord
* @return {string[][]}
*/
var suggestedProducts = function(products, searchWord) {
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggestion: Break down function to match O() complexity

products.sort(sortAsc); /* Time O(N * log(N) */
search(...);		/* Time O(......) */

Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggestion: Look at Trie

/**
 * DFS - Trie
 * Time O(N * M) | Space O(N)
 * https://leetcode.com/problems/search-suggestions-system/
 * @param {string[]} products
 * @param {string} searchWord
 * @return {string[][]}
 */
var suggestedProducts = (products, searchWord) => new Trie()
    .buildTrie(products)
    .searchWord(searchWord);

class Node {
    constructor () {
        this.children = new Map();
        this.isWord = false;
    }
};

class Trie {
    constructor () {
        this.root = new Node();
    }

    buildTrie (products) {
        for (const word of products) {
            this.insert(word);
        }

        return this;
    }
    
    insert (word, { root: node } = this) {        
        for (const char of word.split('')) {
            const child = (node.children.get(char) ?? new Node());
            
            node.children.set(char, child);

            node = child;
        }

        node.isWord = true;
    }
    
    searchWord (searchWord, buffer = [], suggestions = []) {
        for (const char of searchWord.split('')) {
            const prefix = this.getPrefix(buffer, char);
            const words = this.getSuggestions(prefix);

            suggestions.push(words);
        }
        
        return suggestions;
    }

    getPrefix (buffer, char) {
        buffer.push(char);

        return buffer.join('');
    }
    
    getSuggestions (prefix, words = []) {
        const node = this.getPrefixNode(prefix);

        const isInvalidPrefix = (node === null);
        if (isInvalidPrefix) return words
        
        return this.search(node, prefix, words);
    }

    getPrefixNode (prefix, { root: node } = this) {
        for (const char of prefix.split('')) {
            const child = (node.children.get(char) ?? null);

            const isLeafNode = (child === null);
            if (isLeafNode) return null;

            node = child;
        }

        return node;
    }

    search (node, word, words) {
        const isBaseCase = (words.length === 3);
        if (isBaseCase) return words;

        if (node.isWord) words.push(word);

        return this.dfs(node, word, words);
    }

    dfs (node, word, words) {
        for (const char of this.getChars()) {
            const child = (node.children.get(char) ?? null);

            const isLeafNode = (child === null);
            if (isLeafNode) continue;
        
            this.search(child, (word + char), words);
        }

        return words;
    }

    getChars () {
        return new Array(26).fill()
            .map((_, index) => String.fromCharCode((index + 97)));
    }
};

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Don't you think it's too much? I mean, I might be intimidating for some people. NeetCode solved it with binary-search that's how I solved it too. It was more concise that way. But, if you want, I can add this solution in addition to the binary-search one.

Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Trie is typically a better solution since for searching, suggestions, and prefix against words.
Also the complexity is better.

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Ok, I'll implement that.

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@aakhtar3, I added the trie solution. But I kept the binary-search solution for reference.


products.sort((product1, product2) => {
if(product1 < product2) {
return -1;
}
if(product2 < product1) {
return 1;
}
if(product1 === product2) {
return 0;
}
});

const result = [];
let left = 0;
let right = products.length - 1;
for(let i = 0; i < searchWord.length; i++) {
let char = searchWord[i];

while(left <= right && (products[left].length - 1 < i || products[left][i] !== char)) {
left++;
}
while(left <= right && (products[right].length - 1 < i || products[right][i] !== char)) {
right--;
}

const subResult = [];
const len = Math.min(right - left + 1, 3);
for(let j = 0; j < len; j++) {
subResult.push(products[left+j]);
}
result.push(subResult);
}

return result;
};