Why Trie Exists and What Hash Map Cannot Do for Strings in DSA Typescript - Quick Recap

Recall & Review

beginner

What is a Trie data structure?

A Trie is a tree-like data structure that stores strings by sharing common prefixes. Each node represents a character, and paths from root to leaves represent words.

beginner

Why can't a Hash Map efficiently handle prefix searches on strings?

Hash Maps store keys as whole strings and do not share prefixes. They cannot quickly find all keys starting with a prefix without checking every key, making prefix search inefficient.

intermediate

How does a Trie improve prefix search compared to a Hash Map?

A Trie stores strings by characters in a tree, so all words with the same prefix share the same path. This allows fast prefix search by traversing the prefix path once.

beginner

What is a real-life example where Trie is better than Hash Map?

Autocomplete in search engines uses Trie to quickly find all words starting with typed letters, which is slow with Hash Maps because they lack prefix sharing.

intermediate

What is a limitation of Hash Maps when storing many strings with common prefixes?

Hash Maps store each string separately without sharing prefix parts, leading to higher memory use and slower prefix queries compared to Tries.

What does a Trie node typically represent?

A A hash value

B A single character of a string

C A whole string key

D An integer index

Each Trie node represents one character, building paths for strings.

Why is prefix search inefficient in a Hash Map?

A Because Hash Maps store keys as whole strings without prefix sharing

B Because Hash Maps do not store keys in order

C Because Hash Maps use trees internally

D Because Hash Maps only store numbers

Hash Maps treat keys as whole units, so prefix search requires checking all keys.

Which data structure is best for autocomplete features?

A Trie

B Hash Map

C Stack

D Queue

Trie efficiently supports prefix queries needed for autocomplete.

What is a key advantage of Trie over Hash Map for strings?

A Uses less memory for all data types

B Faster exact string lookup

C Supports numeric keys

D Efficient prefix search and memory sharing

Trie shares prefixes, saving memory and enabling fast prefix search.

Which operation is NOT efficient in a Trie?

A Prefix search

B Exact string search

C Random access by index

D Finding all keys with a prefix

Trie is not designed for random access by index; it is optimized for prefix and exact searches.

Explain why Tries exist and what problems they solve that Hash Maps cannot for string data.

Think about how strings with common beginnings are stored and searched.

Describe a real-world scenario where using a Trie is better than a Hash Map for handling strings.

Consider typing in a search box and getting instant suggestions.

Practice

1. Why do we use a Trie data structure instead of a Hash Map for storing many strings?

easy

A. Because Trie is faster for exact string lookups than Hash Maps

B. Because Trie uses less memory than a Hash Map for all cases

C. Because Hash Maps cannot store strings as keys

D. Because Trie efficiently supports prefix-based searches and auto-completion

Solution

1. Step 1: Understand Trie and Hash Map capabilities

   Trie stores strings in a tree form, allowing quick prefix searches. Hash Maps store keys but do not support prefix queries efficiently.

2. Step 2: Compare use cases for prefix search

   Trie can find all strings starting with a prefix quickly, which Hash Maps cannot do without scanning all keys.

3. Final Answer:

   Because Trie efficiently supports prefix-based searches and auto-completion -> Option D

4. Quick Check:

   Prefix search = Trie [OK]

Hint: Trie = prefix search; Hash Map = exact key lookup [OK]

Common Mistakes:

• Thinking Hash Maps support prefix search efficiently
• Assuming Trie always uses less memory
• Believing Hash Maps cannot store strings as keys

2. Which of the following is the correct TypeScript syntax to declare a Trie node with children as a Map of characters to nodes?

easy

A. class TrieNode { children: Map = new Map(); }

B. class TrieNode { children: Map = new Map(); }

C. class TrieNode { children: Map = new Map(); }

D. class TrieNode { children: Map = new Map(); }

Solution

1. Step 1: Understand Map type declaration in TypeScript

   Map keys and values must be typed as Map. Here keys are characters (string), values are TrieNode.

2. Step 2: Check each option's syntax

   class TrieNode { children: Map = new Map(); } correctly declares children as Map initialized with new Map(). Others have wrong generic order or types.

3. Final Answer:

   class TrieNode { children: Map = new Map(); } -> Option A

4. Quick Check:

   Map syntax correct [OK]

Hint: Map with correct order and initialization [OK]

Common Mistakes:

• Swapping key and value types in Map
• Not initializing Map with new Map()
• Using wrong generic types for Map

3. Given the following TypeScript Trie insertion code snippet, what will be the output after inserting words ['cat', 'car', 'dog'] and searching for prefix 'ca'?

class TrieNode {
  children: Map = new Map();
  isEnd: boolean = false;
}

class Trie {
  root = new TrieNode();

  insert(word: string) {
    let node = this.root;
    for (const ch of word) {
      if (!node.children.has(ch)) {
        node.children.set(ch, new TrieNode());
      }
      node = node.children.get(ch)!;
    }
    node.isEnd = true;
  }

  startsWith(prefix: string): boolean {
    let node = this.root;
    for (const ch of prefix) {
      if (!node.children.has(ch)) return false;
      node = node.children.get(ch)!;
    }
    return true;
  }
}

const trie = new Trie();
['cat', 'car', 'dog'].forEach(w => trie.insert(w));
console.log(trie.startsWith('ca'));

medium

A. undefined

B. true

C. false

D. Error at runtime

Solution

1. Step 1: Insert words into Trie

   Words 'cat', 'car', and 'dog' are inserted. 'ca' prefix nodes are created for 'c' and 'a'.

2. Step 2: Check startsWith for 'ca'

   Traversal finds nodes for 'c' and 'a' successfully, so returns true.

3. Final Answer:

   true -> Option B

4. Quick Check:

   Prefix 'ca' exists = true [OK]

Hint: If prefix nodes exist, startsWith returns true [OK]

Common Mistakes:

• Confusing startsWith with exact word search
• Assuming isEnd must be true for prefix check
• Expecting false if prefix is partial

4. The following TypeScript Trie search method is intended to check if a word exists. What is the bug?

search(word: string): boolean {
  let node = this.root;
  for (const ch of word) {
    if (!node.children.has(ch)) return false;
    node = node.children.get(ch)!;
  }
  return false;
}

medium

A. It always returns false even if word exists

B. It throws an error when word is empty

C. It returns true for any prefix, not full word

D. It does not check if node is null

Solution

1. Step 1: Analyze the return statement after loop

   The method returns false after the loop without checking if the last node marks end of a word.

2. Step 2: Identify missing isEnd check

   It should return node.isEnd to confirm full word presence, not just prefix.

3. Final Answer:

   It always returns false even if word exists -> Option A

4. Quick Check:

   Missing isEnd check causes always false [OK]

Hint: Check isEnd after traversal to confirm full word [OK]

Common Mistakes:

• Returning false without checking isEnd
• Confusing prefix search with full word search
• Ignoring empty string edge case

5. You want to store a large dictionary of words and quickly find all words starting with a given prefix. Why is a Trie better than a Hash Map for this, and what is a limitation of Hash Map in this scenario?

hard

A. Trie uses less memory than Hash Map; Hash Map cannot store string keys longer than 10 characters.

B. Trie supports exact word search only; Hash Map supports prefix search but slower.

C. Trie stores words in a prefix tree allowing fast prefix queries; Hash Map can't efficiently find keys by prefix without scanning all keys.

D. Trie is slower for insertion; Hash Map is faster for prefix search.

Solution

1. Step 1: Understand Trie prefix storage

   Trie organizes words by shared prefixes in a tree, enabling quick retrieval of all words with a prefix.

2. Step 2: Understand Hash Map limitations

   Hash Map stores keys without order, so prefix search requires checking all keys, which is inefficient.

3. Final Answer:

   Trie stores words in a prefix tree allowing fast prefix queries; Hash Map can't efficiently find keys by prefix without scanning all keys. -> Option C

4. Quick Check:

   Prefix search efficiency = Trie advantage [OK]

Hint: Trie = fast prefix search; Hash Map = no prefix search [OK]

Common Mistakes:

• Thinking Hash Map supports prefix search efficiently
• Assuming Trie uses less memory always
• Confusing exact search with prefix search