[PYTHON] - Simple solution, backtracking✅
\nclass Solution:\n    def maxProduct(self, s: str) -> int:\n        self.answer = 0\n        \n        def dfs(i, word, word2):\n            if i >= len(s):\n 
```\nclass Solution:\n    def maxProduct(self, s: str) -> int:\n        self.answer = 0\n        \n        def dfs(i, word, word2):\n            if i >= len(s):\n                if word == word[::-1] and word2 == word2[::-1]:\n                    self.answer = max(len(word) * len(word2), self.answer)\n                return\n            \n            dfs(i + 1, word + s[i], word2)\n            dfs(i + 1, word, word2 + s[i])\n            dfs(i + 1, word, word2)\n            \n        dfs(0, \'\', \'\')\n        \n        return self.answer\n```
['Backtracking', 'Recursion', 'Python', 'Python3']