Explain the trie data structure.
01
01
Understand the problem
triestrings
02
02
Attempt it yourself
Sketch your approach before reading the solution — that's what interviews test.
Stuck? AI Nudge Available
Get a conceptual hint to guide your logic without spoiling the final implementation.
03
03
Study the solution
The solution is waiting
Give it an honest attempt first — then compare your thinking with the full walkthrough.
04
04
Read the code
Trie: insert, search, startsWith
Run Playgroundclass Trie:
def __init__(self):
self.root = {}
def insert(self, word):
node = self.root
for ch in word:
node = node.setdefault(ch, {})
node["$"] = True # end-of-word marker
def search(self, word):
node = self._walk(word)
return node is not None and "$" in node
def starts_with(self, prefix):
return self._walk(prefix) is not None
def _walk(self, s):
node = self.root
for ch in s:
if ch not in node: return None
node = node[ch]
return node
# --- demo ---
t = Trie()
for w in ["cat", "car", "can"]:
t.insert(w)
print(t.search("car")) # True
print(t.search("ca")) # False (prefix, not a full word)
print(t.starts_with("ca")) # True05
05
Join the discussion
Discussion (0)
Sign in to join the discussion.
No responses yet. Be the first to share what you think.