🔒 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 →
← Courses›Interview Prep›Module 2 · Arrays, Strings, Two-Pointer · Recap›Backtracking: word search in gridwrite31 / 104
+125 XP
Task
📝 **Task:** Print `exist(board, 'ABCCED')` for `board=[['A','B','C','E'],['S','F','C','S'],['A','D','E','E']]`. Expected: True
📋 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.