Skip to main content
← CoursesInterview PrepModule 3 · Trees, Graphs, BFS/DFSTries: word search IIwrite36 / 100
💬 Discuss🧪 Playground+150 XP
Task
📝 **Task:** Print sorted found words for board=[['o','a','a','n'],['e','t','a','e'],['i','h','k','r'],['i','f','l','v']] and words=['oath','pea','eat','rain']. Expected: ['eat', 'oath'] 📋 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…