code: def exist(self, board: [[str]], word: str) -> bool:
      if not word or not board:
          return False
  
      for i in range(
          len(board)
      ):  # Let this for loop get the first matching letter
          for j in range(len(board[0])):
              if board[i][j] == word[0]:
                  self.found = self.dfs(
                      board, i, j, word[1:]
                  )  # Passing the first matching indices and remaining letters to dfs
      return self.found
  
label_desc: Use image node_id 2 for calling the Solution obj's underlying member method code with example usage: obj.exist(board, word) and returns: self, False