[python] iterative based brute force solution
things to notice :\n1.deep copy\n2. covering every start point\n```\nclass Solution:\n    def maxProduct(self, s: str) -> int:\n        q= deque()\n        for 
things to notice :\n1.deep copy\n2. covering every start point\n```\nclass Solution:\n    def maxProduct(self, s: str) -> int:\n        q= deque()\n        for i in range(len(s)):\n            q.append((s[i],[i]))\n        ml=0\n        n=0\n        while q:\n            st,li=q.pop()\n            if st==st[::-1]:\n                s2=\'\'\n                for x in range(len(s)):\n                    if x not in li:\n                        s2+=s[x]\n                if s2!=\'\':\n                    l1=len(st)\n                    q2=deque()\n                    for i in range(len(s2)):\n                        q2.append((s2[i],[i]))\n                    while q2:\n                        st2,li2=q2.pop()\n                        if st2==st2[::-1]:\n                            ml=max(l1*len(st2),ml)\n                        for j in range(li2[-1]+1,len(s2)):\n                            ls2=li2[:]\n                            ls2.append(j)\n                            q2.append((st2+s2[j],ls2))\n\n            for i in range(li[-1]+1,len(s)):\n                ls=li[:]\n                ls.append(i)\n                q.append((st+s[i],ls))\n        return ml
['Iterator', 'Python']