4030. Check ASCII Palindromic

You are given a string s consisting of lowercase English letters.

Construct a binary string by replacing each character in s with the 8-bit binary representation of its ASCII value, including leading zeros, while preserving the original order of the characters.

Return true if the resulting binary string is a palindrome. Otherwise, return false.

class Solution {
public:
    bool isPalindromic(string s) {
        string ss;
        for(auto& ch : s) {
            ss += format("{:08b}", ch);
        }
        cout<<ss<<endl;
        for(int l = 0, r = ss.size() - 1; l < r; l++,r--) {
            if(ss[l] != ss[r]) return false;
        }
        return true;
    }
};