class Solution {
public:
    string longestPalindrome(string s) {
        if(s.empty()){
            return s;
        }
        //taking care of odd palindromes
        int m_start = 0;
        int m_end  = 0;
        int longest = 1;
        
        for(int i = 0; i<s.length(); i++){
            
            int offset = 0;
            while(i-1-offset >= 0 && i+1+offset < s.length() && s[i-1-offset] == s[i+1+offset]){
               offset++;
            }
            
            int length = 2*offset+1;
            if(length > longest){
                longest = length;
                m_start = i-offset;
                m_end = i+offset;
            }
        }
        
        //even palindromes
        for(int i=0; i<s.length();i++){
            int offset = 0;
            
            while(i-offset >=0 && i+offset+1 < s.length() && s[i-offset] == s[i+offset+1]){
                offset++;
            }
            
            int length = 2*offset;
            
            if(length > longest){
                longest = length;
                m_start = i-offset+1;
                m_end = i+offset;
                
            }
        }
        
        return s.substr(m_start,m_end-m_start+1);
    }
};