Competitive ProgrammingEasy

Trie Implementation

Detailed guide and Python implementation for the 'Trie Implementation' problem.

Problem Statement

Easy

Write a function run_trie_operations(commands, arguments) that simulates Trie operations. The function takes a list of command strings and a list of argument lists, executing them in order and returning a list of the execution results. The commands are:

- 'Trie': Initialize a Trie (returns None)

- 'insert': Inserts a string into the Trie (returns None)

- 'search': Returns True if the string is in the Trie, else False

- 'startsWith': Returns True if there is any word in the Trie that starts with the given prefix, else False.

Constraints
  • 1 <= len(commands) <= 1000
  • 1 <= len(arguments[i]) <= 1
  • All words and prefixes consist of lowercase English letters.

Examples

Example 1
Input
run_trie_operations(['Trie', 'insert', 'search', 'startsWith', 'insert', 'search'], [[], ['apple'], ['apple'], ['app'], ['app'], ['app']])
Output
[None, None, True, True, None, True]
Explanation

1. Initialize Trie -> None 2. Insert 'apple' -> None 3. Search 'apple' -> True 4. StartsWith 'app' -> True 5. Insert 'app' -> None 6. Search 'app' -> True

Need a Hint?
Consider using Trie-specific data structures like sets or heaps.
Edge Cases to Watch
  • Empty input structures
  • Single element inputs
  • Large numerical bounds

Ready to Solve?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

Open in Editor

Recommended Python Resources

Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.