Why Autocomplete System with Trie in DSA Rust?

The Big Idea

What if your device could guess your words instantly, saving you time and effort every time you type?

The Scenario

Imagine typing a long list of words manually every time you want to find suggestions for a search or a message. You try to remember all possible words and write them down one by one.

This is like flipping through a huge dictionary page by page to find words starting with certain letters.

The Problem

Manually searching through all words is very slow and tiring. You might miss words or make mistakes.

It wastes time and effort, especially when the list is very large or you want suggestions instantly.

The Solution

A Trie is like a smart tree that stores words by their letters. It helps you quickly find all words starting with a prefix without checking every word.

This makes autocomplete fast and easy, giving suggestions as you type.

Before vs After

✗ Before

fn find_words(prefix: &str, words: &[&str]) -> Vec<&str> {
    let mut results = Vec::new();
    for &word in words {
        if word.starts_with(prefix) {
            results.push(word);
        }
    }
    results
}

✓ After

struct TrieNode {
    children: [Option<Box<TrieNode>>; 26],
    is_word: bool,
}

impl TrieNode {
    fn new() -> Self {
        Self { children: Default::default(), is_word: false }
    }
}

struct Trie {
    root: TrieNode,
}

impl Trie {
    fn new() -> Self {
        Self { root: TrieNode::new() }
    }

    fn insert(&mut self, word: &str) {
        let mut current = &mut self.root;
        for ch in word.chars() {
            let index = (ch as usize) - ('a' as usize);
            current = current.children[index].get_or_insert_with(|| Box::new(TrieNode::new()));
        }
        current.is_word = true;
    }

    // autocomplete method omitted for brevity
}

What It Enables

Autocomplete with Trie enables instant, accurate word suggestions as you type, making typing faster and smarter.

Real Life Example

When you type a search query on your phone or computer, the system suggests words or phrases instantly, helping you find what you want quickly.

Key Takeaways

Manual search is slow and error-prone for autocomplete.

Trie stores words by letters for fast prefix search.

Autocomplete with Trie improves typing speed and accuracy.

Practice

1. What is the main purpose of using a Trie in an autocomplete system?

easy

A. To sort words alphabetically

B. To count the total number of words

C. To efficiently store and search prefixes of words

D. To reverse the input strings

Solution

1. Step 1: Understand the role of Trie in prefix search

   A Trie is a tree-like data structure designed to store strings by their prefixes, allowing quick prefix-based searches.

2. Step 2: Connect Trie usage to autocomplete

   Autocomplete requires finding all words starting with a given prefix efficiently, which a Trie supports well.

3. Final Answer:

   To efficiently store and search prefixes of words -> Option C

4. Quick Check:

   Trie = prefix search [OK]

Hint: Trie stores prefixes for fast autocomplete search [OK]

Common Mistakes:

• Confusing Trie with sorting data structure
• Thinking Trie counts words only
• Assuming Trie reverses strings

2. Which of the following is the correct Rust syntax to define a Trie node struct with children as a HashMap and an is_end boolean?

easy

A. struct TrieNode { children: HashMap, is_end: bool }

B. struct TrieNode { children: HashMap, is_end: bool }

C. struct TrieNode { children: Vec<char>, is_end: bool }

D. struct TrieNode { children: HashMap, is_end: bool }

Solution

1. Step 1: Understand Rust ownership and recursive types

   Rust requires recursive types like TrieNode to use pointers such as Box to avoid infinite size errors.

2. Step 2: Check each option's children type

   struct TrieNode { children: HashMap, is_end: bool } uses HashMap, which is correct for recursive Trie nodes. struct TrieNode { children: HashMap, is_end: bool } lacks Box, causing compile error. struct TrieNode { children: Vec<char>, is_end: bool } uses Vec<char>, which is incorrect for children mapping. struct TrieNode { children: HashMap, is_end: bool } uses HashMap, which is incorrect because keys should be single chars.

3. Final Answer:

   struct TrieNode { children: HashMap, is_end: bool } -> Option A

4. Quick Check:

   Recursive struct needs Box pointer [OK]

Hint: Use Box for recursive struct fields in Rust [OK]

Common Mistakes:

• Omitting Box causes compile errors
• Using Vec instead of HashMap for children
• Using String keys instead of char

3. Given the following Rust code snippet for inserting words into a Trie, what will be the output of searching for prefix "ca"?

let mut trie = Trie::new();
trie.insert("cat");
trie.insert("car");
trie.insert("dog");
let results = trie.search_prefix("ca");
println!("{:?}", results);

medium

A. ["dog"]

B. ["cat", "car"]

C. ["cat"]

D. []

Solution

1. Step 1: Insert words into Trie

   The words "cat", "car", and "dog" are inserted. "cat" and "car" share prefix "ca".

2. Step 2: Search for prefix "ca"

   Searching prefix "ca" returns all words starting with "ca", which are "cat" and "car".

3. Final Answer:

   ["cat", "car"] -> Option B

4. Quick Check:

   Prefix "ca" matches "cat", "car" [OK]

Hint: Search prefix returns all words starting with it [OK]

Common Mistakes:

• Returning only one matching word
• Returning words without the prefix
• Returning empty list incorrectly

4. Identify the bug in this Rust Trie insertion method snippet:

fn insert(&mut self, word: &str) {
    let mut node = &self.root;
    for ch in word.chars() {
        node = node.children.entry(ch).or_insert(TrieNode::new());
    }
    node.is_end = true;
}

medium

A. word.chars() should be collected into a vector first

B. Use of entry() is incorrect for insertion

C. is_end should be set before the loop

D. node should be mutable reference (&mut) to modify children

Solution

1. Step 1: Analyze mutability of node reference

   node is assigned as immutable reference &self.root, but children need to be modified, so node must be mutable reference &mut.

2. Step 2: Understand why mutability is needed for entry()

   entry() modifies the HashMap, so node must be mutable to call entry() and insert new nodes.

3. Final Answer:

   node should be mutable reference (&mut) to modify children -> Option D

4. Quick Check:

   Mutable reference needed for insertion [OK]

Hint: Use &mut to modify Trie nodes during insertion [OK]

Common Mistakes:

• Using immutable reference for mutable operations
• Setting is_end too early
• Unnecessary collection of chars

5. You want to extend a Trie-based autocomplete system to return suggestions sorted by frequency of word usage. Which data structure modification is best to support this efficiently?

hard

A. Store a frequency count at each end node and use a max-heap during search

B. Store words in a vector and sort on every search

C. Use a linked list to store words in insertion order

D. Store frequency counts but ignore them during search

Solution

1. Step 1: Understand frequency storage in Trie nodes

   Storing frequency counts at end nodes tracks how often each word is used.

2. Step 2: Use max-heap to retrieve top frequent words efficiently

   During prefix search, a max-heap can quickly select highest frequency words without sorting all results.

3. Final Answer:

   Store a frequency count at each end node and use a max-heap during search -> Option A

4. Quick Check:

   Frequency + max-heap = efficient top suggestions [OK]

Hint: Use frequency counts + max-heap for fast top suggestions [OK]

Common Mistakes:

• Sorting all words on every search (slow)
• Ignoring frequency data
• Using linked list which is inefficient for sorting