Skip to main content
← CoursesInterview PrepModule 3 · Trees, Graphs, BFS/DFSTries (prefix trees) — implementationwrite35 / 100
💬 Discuss🧪 Playground+125 XP
Task
📝 **Task:** Insert 'apple' into a Trie. Print `search('apple')`, then `search('app')`, then `starts_with('app')`. Expected: True False True 📋 Edit the starter code. Tests run automatically. 💡 **Hint:** Re-read the theory if stuck.

Keep going

✏️ Write your code here
🐍
Loading Python...
First visit only — ~5-10s. Stays cached afterward.
📊 Result
Press Run to see result...
📣 Help someone learn PythonShare this lesson with a friend — the first 15 are free, no signup.Tweet

💬 Discussion

Be the first to ask a question or share a tip.
Sign in to join the discussion. Reading is free.
Loading discussion…