Skip to main content
🔒 Preview mode. The first 15 Foundations lessons are free; this one is Pro. Start a 7-day trial to unlock the editor, AI hints and the rest of the curriculum. Card required, cancel any time in Dashboard.Start 7-day trial →
← CoursesInterview PrepModule 3 · Trees, Graphs, BFS/DFSTries: word search IIwrite37 / 104
+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.
✏️ Write your code here
🐍
Loading Python...
One-time download (~1 MB). Then it runs instantly.
📊 Result
Press Run to see result...

💬 Discussion

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