134. Implement Trie (Prefix Tree)

PRO

Medium

Topics

Companies

Hint

Understand Before Coding

Step 0 / 27

Speed: 1.0x

insert: ""

Active Node End of Word Found State Not Found State

Initialize the Trie with a root node.

Variables

curroot

c-

word-

Loading visualization...

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input:

operations = ["Trie", "insert", "search", "search", "startsWith", "insert", "search"], words = [[], ["apple"], ["apple"], ["app"], ["app"], ["app"], ["app"]]

Output: [null, null, true, false, true, null, true]

Explanation: Demonstrates insertion, searching for existing and non-existing words, and prefix searching.

Example 2:

Input: operations = ["Trie", "insert", "search", "startsWith"], words = [[], ["a"], ["a"], ["a"]]

Output: [null, null, true, true]

Explanation: Tests with a single character word/prefix.

Constraints:

•
•
•

Time Complexity

O(m)

Space Complexity

O(n*m)

134. Implement Trie (Prefix Tree)

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

134. Implement Trie (Prefix Tree)

Understand Before Coding

insert: ""

Variables

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

insert: ""

Variables