You are given a string s consisting of lowercase English letters.
Construct a 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 . Otherwise, return false.
Example 1:
Input: s = "ff"
Output: true
Explanation:
f is 102, whose 8-bit binary representation is 01100110.0110011001100110.true.Example 2:
Input: s = "leet"
Output: false
Explanation:
l, e, e, and t are 108, 101, 101, and 116, respectively.01101100, 01100101, 01100101, and 01110100.01101100011001010110010101110100.false.
Constraints:
1 <= s.length <= 100s consists of lowercase English letters.