class Solution {
public:
    bool isGoodLength(int len, string& s) {
        
    }

    string longestPalindrome(string s) {
        int l = 1; // a string of length 1 can always be a pallindrome
        int r = s.length() + 1; // it is impossible to find a string of length s.length() + 1, leave alone pallindromic

        while(r > l + 1) {
            int mid = l + (r - l) / 2;

            if(isGoodLength(mid, s)) {
                l = mid;
            } else {
                r = mid;
            }
        }
    }
};

Eqtt vw wvm awtdm ug xchhtm?

#!/bin/bash
yum -y install httpd
systemctl enable httpd
systemctl start httpd
hostname > /var/www/html/index.html

alert('123');

fsfsdfsdfdsfsdf

fsdfsdfsdf