python 3 || DFS || Backtracking
```\n\nclass Solution:\n    def exist(self, board: List[List[str]], word: str) -> bool:\n        def dfs(board,i,j,count,word):\n            if(count == len(wor
```\n\nclass Solution:\n    def exist(self, board: List[List[str]], word: str) -> bool:\n        def dfs(board,i,j,count,word):\n            if(count == len(word)):\n                return True\n            if i<0 or j<0 or i>=len(board) or j>=len(board[0]) or word[count]!=board[i][j]:\n                return False\n            temp = board[i][j]\n            board[i][j] = ""\n            found = dfs(board,i+1,j,count+1,word) or dfs(board,i-1,j,count+1,word) or dfs(board,i,j+1,count+1,word) or dfs(board,i,j-1,count+1,word)\n            board[i][j] = temp\n            return found\n        \n        for i in range(len(board)):\n            for j in range(len(board[0])):\n                if board[i][j] == word[0] and dfs(board,i,j,0,word):\n                    return True\n        return False
['Backtracking', 'Depth-First Search', 'Python3']