class Solution{
    public: 
        string LongestPalindrome(string s){
            for(int length= s.size();i>0;i--){
                for(int start = 0;start<=s.size()-length;start++){
                    if(check(s,start,start+length))
                        return s.substr(start,length);
                }
            }
        }
            private: bool check(string s, int i, int j){
                         int left = i;
                         int right = j-1;
                         while(left<right){
                             if(s[left]!=S[right])
                                 return false;
                             left++;
                             right--;
                         }
                         return true;
                     }
        
};