Please solve the programming task below using a self-contained code snippet in a markdown code block.

You are given a string s. An awesome substring is a non-empty substring of s such that we can make any number of swaps in order to make it a palindrome.
Return the length of the maximum length awesome substring of s.
 
Please complete the following python code precisely:
```python
class Solution:
    def longestAwesome(self, s: str) -> int:
```