Implement Trie

Design Add and Search Words

Word Search

Execute insert, exact-search, and prefix-search operations on a trie.

Execute parallel `operations` and `words`. Operations are `insert`, `search`, or `startsWith`; return `1` for true and `0` for false for query operations in order.

## Example
```json
Input: {"operations":["insert","search","search","startsWith","insert","search"],"words":["apple","apple","app","app","app","app"]}
Output: [1,0,1,1]
```

## Constraints
- 1 <= operations.length == words.length <= 10000
- Words contain lowercase English letters

## Follow-up
How do array children compare with hash-map children?

The key pattern is: Trie edges share prefixes across inserted words. Identify the state and invariant before coding.

Recognize the Pattern

Advance one state transition at a time. Mark or update state before exploring dependent work.

Build the Algorithm

Test empty or minimal input, skewed shapes, duplicates where allowed, and impossible outcomes.

Check Edge Cases

Time: O(total characters). Space: O(total inserted characters).