Trie Variation

-
Here is the problem: https://leetcode.com/problems/search-suggestions-system/
1268. Search Suggestions System
Medium
Given an array of strings products and a string searchWord. We want to design a system that suggests at most three product names from products after each character of searchWord is typed. Suggested products should have common prefix with the searchWord. If there are more than three products with a common prefix return the three lexicographically minimums products.
Return list of lists of the suggested products after each character of searchWord is typed. 

Example 1:
Input: products = ["mobile","mouse","moneypot","monitor","mousepad"], searchWord = "mouse"
Output: [
["mobile","moneypot","monitor"],
["mobile","moneypot","monitor"],
["mouse","mousepad"],
["mouse","mousepad"],
["mouse","mousepad"]
]
Explanation: products sorted lexicographically = ["mobile","moneypot","monitor","mouse","mousepad"]
After typing m and mo all products match and we show user ["mobile","moneypot","monitor"]
After typing mou, mous and mouse the system suggests ["mouse","mousepad"]
Example 2:
Input: products = ["havana"], searchWord = "havana"
Output: [["havana"],["havana"],["havana"],["havana"],["havana"],["havana"]]
Example 3:
Input: products = ["bags","baggage","banner","box","cloths"], searchWord = "bags"
Output: [["baggage","bags","banner"],["baggage","bags","banner"],["baggage","bags"],["bags"]]
Example 4:
Input: products = ["havana"], searchWord = "tatiana"
Output: [[],[],[],[],[],[],[]]

Constraints:
  • 1 <= products.length <= 1000
  • There are no repeated elements in products.
  • 1 <= Σ products[i].length <= 2 * 10^4
  • All characters of products[i] are lower-case English letters.
  • 1 <= searchWord.length <= 1000
  • All characters of searchWord are lower-case English letters.
Trie fits well for this problem, with a simple variation: the keys should be sorted. Hence instead of using a simple Hash Map to stored the nodes of the trie, change it to a Sorted Dictionary. The main implementation is here where the key is to systematically cover all the base cases, and the induction will leverage the fact that keys are sorted which will generate the desired lexicographic order, this is the for loop that does so. Slow, but enough to pass. Cheers, ACC.

public class Trie
{
    private SortedDictionary<char, Trie> sd = null;
    private bool endOfWord = false;
    public Trie()
    {
        sd = new SortedDictionary<char, Trie>();
        endOfWord = false;
    }

    public void Insert(string word)
    {
        if (String.IsNullOrEmpty(word)) this.endOfWord = true;
        else if (sd.ContainsKey(word[0])) (sd[word[0]]).Insert(word.Substring(1));
        else
        {
            Trie newTrie = new Trie();
            sd.Add(word[0], newTrie);
            (sd[word[0]]).Insert(word.Substring(1));
        }
    }

    public void SearchMaxMatches(string searchWord,
                                    string currentWord,
                                    int MAX,
                                    ref int numberMatches,
                                    List<string> matches)
    {
        if (numberMatches >= MAX) return;
        if (!String.IsNullOrEmpty(searchWord) && !sd.ContainsKey(searchWord[0])) return;
        if (!String.IsNullOrEmpty(searchWord) && sd.ContainsKey(searchWord[0]))
        {
            sd[searchWord[0]].SearchMaxMatches(searchWord.Substring(1), currentWord + searchWord[0].ToString(), MAX, ref numberMatches, matches);
            return;
        }

        //Searchword is empty
        if (endOfWord)
        {
            matches.Add(currentWord);
            numberMatches++;
        }
        foreach (char key in sd.Keys)
        {
            sd[key].SearchMaxMatches(searchWord, currentWord + key.ToString(), MAX, ref numberMatches, matches);
        }
    }
}

public class Solution
{
    public IList<IList<string>> SuggestedProducts(string[] products, string searchWord)
    {
        Trie trie = new Trie();
        foreach (string product in products) trie.Insert(product);

        List<IList<string>> retVal = new List<IList<string>>();
        for (int i = 1; i <= searchWord.Length; i++)
        {
            List<string> matches = new List<string>();
            int numberMatches = 0;
            trie.SearchMaxMatches(searchWord.Substring(0, i), "", 3, ref numberMatches, matches);
            retVal.Add(matches);
        }

        return retVal;
    }
}

Comments

Post a Comment

Popular posts from this blog

Advent of Code - Day 6, 2024: BFS and FSM

-
Image
To solve this Advent of Code (parts 1 and 2), I used Breadth-First Search (BFS) to keep moving the guard as well as Finite State Machine (FSM) to control the directions. This solves part 1 easily. Part 2 can be solved using the same technique, takes a little longer since you need to try every empty cell, but it eventually does the trick (takes a min or so). Code is down below, cheers, ACC. Day 6 - Advent of Code 2024 using System.IO; using System.Collections; using System; using System.Text; using System.Text.RegularExpressions; using System.ComponentModel.DataAnnotations; Process2(); void Process() { string fileName = "input.txt"; FileInfo fileInfo = new FileInfo(fileName); StreamReader sr = fileInfo.OpenText(); List map = new List (); int startRow = 0; int startCol = 0; while (!sr.EndOfStream) { string line = sr.ReadLine().Trim(); map.Add(new StringBuilder(line)); int indexStart = line.IndexOf('^'); ...
Read more

Golang vs. C#: performance characteristics (simple case study)

-
Image
This is an interesting example to study the performance characteristics of Golang compared to C# for a very particular case (not generalized though).  The same code was written in C# and Golang (literally translated from one to the other). Below you'll be able to see the source code for both. The problem is a simple post-order DFS in a tree-like graph. The code in C# times out (TLE = Time Limited Exceeded). The code in Golang not only works but beats 100% of the other Golang submissions. Take a look the image below: Some potential reasons for the performance gains from Go in this particular example are: 1. Language and Runtime Differences:    Go is compiled directly to machine code, while C# typically runs on a virtual machine (CLR).    Go has a simpler runtime with less overhead compared to the .NET runtime.    Go's garbage collector is designed for low latency, which can lead to better performance in some scenarios. 2. Data Structures:    G...
Read more

Advent of Code - Day 7, 2024: Backtracking and Eval

-
Image
Problem today requires backtracking and eval (evaluating a mathematical expression in the format of a string). Glad that it used a left-2-right evaluation, makes for an easy parsing and not overly complicated evaluation function. Code is down below for parts 1 and 2. Cheers, ACC. Day 7 - Advent of Code 2024 using System.IO; using System.Collections; using System; using System.Text; using System.Text.RegularExpressions; using System.ComponentModel.DataAnnotations; Process2(); void Process() { string fileName = "input.txt"; long retVal = 0; FileInfo fileInfo = new FileInfo(fileName); StreamReader sr = fileInfo.OpenText(); while (!sr.EndOfStream) { string line = sr.ReadLine().Trim(); string[] parts1 = line.Split(':'); long target = Int64.Parse(parts1[0]); string[] numbers = parts1[1].Split(new char[] { ' ' }, StringSplitOptions.RemoveEmptyEntries); if (TryAll1(numbers, target, "", 0)) r...
Read more