Trie Prefix Tree (Practice 5012): Practice

Format: Markdown
 ( View Raw)
Date: Sat, 07 Nov 2026 at 23:13:57

# Trie Prefix Tree (Practice 5012): Practice

Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.

## Approach

nested dict nodes.

```python
class Trie:
    def __init__(self): self.root={}
    def insert(self,w):
        n=self.root
        for c in w: n=n.setdefault(c,{})
        n['$']=True
    def search(self,w):
        n=self.root
        for c in w:
            if c not in n: return False
            n=n[c]
        return '$' in n
```

## Complexity

Linear in the dominant input size for the scan; heap/tree variants add a log factor.

## Interview pitfalls

State the invariant out loud, name the complexity, then code. Skipping the invariant is the usual fail mode.

## Practicing out loud

Narrate the approach, complexity and one edge case in under a minute. Disclosure: I work on Linkjob AI, a real-time interview assistant. If you want live practice help, see [official website](https://www.linkjob.ai/).