Easy C++ dfs solution
\nclass Solution {\nprivate:\n    bool dfs(vector<vector<char>>& board,int i, int j , int count, string word){\n        if(count == word.length())\n            
```\nclass Solution {\nprivate:\n    bool dfs(vector<vector<char>>& board,int i, int j , int count, string word){\n        if(count == word.length())\n            return true;\n        if(i<0 || i>=board.size()||j<0 || j>=board[i].size() || board[i][j]!=word[count])\n             return false;\n        char temp = board[i][j];\n        board[i][j]= \' \';\n        bool found = dfs(board,i+1,j,count+1,word)||dfs(board,i-1,j,count+1,word)||dfs(board,i,j+1,count+1,word)||dfs(board,i,j-1,count+1,word);\n        board[i][j]= temp;\n        return found;\n    }\npublic:\n    bool exist(vector<vector<char>>& board, string word) {\n        for(int i=0;i<board.size();i++){\n            for(int j=0;j<board[i].size();j++){\n                if(board[i][j]==word[0] and dfs(board,i,j,0,word))\n                    return true;\n            }\n        }\n        return false;\n    }\n\n};\n```
['Depth-First Search', 'Recursion', 'C']