[Python3] 98% Fast Solution
\nfrom itertools import groupby\n\nclass Solution:\n    def longestBeautifulSubstring(self, word: str) -> int:\n        arr = groupby(word)\n        \n        a
```\nfrom itertools import groupby\n\nclass Solution:\n    def longestBeautifulSubstring(self, word: str) -> int:\n        arr = groupby(word)\n        \n        ans = []\n        \n        count = 0\n        \n        for i , j in arr:\n            ans.append([i , list(j)])\n                \n        for i in range(len(ans) - 4):\n            if(ans[i][0] == \'a\' and ans[i + 1][0] == \'e\' and ans[i + 2][0] == \'i\' and ans[i + 3][0] == \'o\' and ans[i + 4][0] == \'u\'):\n                count = max(count , len(ans[i][1]) + len(ans[i + 1][1]) + len(ans[i + 2][1]) + len(ans[i + 3][1]) + len(ans[i + 4][1])) \n                \n        \n        return count\n```
['Python3']