# Implement Trie Prefix Tree (Practice 5040): Walkthrough Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note. ## Approach Nested dicts with an end marker; startsWith just walks without checking the marker. ```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 _walk(self,w): n=self.root for c in w: if c not in n: return None n=n[c] return n def search(self,w): n=self._walk(w);return bool(n and '$' in n) def starts_with(self,p): return self._walk(p) is not None ``` ## 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 [Linkjob AI](https://www.linkjob.ai/).