Tap here to switch tabs
Problem
Submissions

Problem: Check ASCII Palindromic

med
30 min
Try to solve the Check ASCII Palindromic problem.

Statement

Given a string s, convert each character into its 88 bit binary representation based on its ASCII value and concatenate them in order to form a single binary string.

Return true if the resulting binary string is a palindrome, or false otherwise.

Constraints:

  • 1≤1 \leq s.length ≤100\leq 100

  • s consists of lowercase English letters.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Check ASCII Palindromic

med
30 min
Try to solve the Check ASCII Palindromic problem.

Statement

Given a string s, convert each character into its 88 bit binary representation based on its ASCII value and concatenate them in order to form a single binary string.

Return true if the resulting binary string is a palindrome, or false otherwise.

Constraints:

  • 1≤1 \leq s.length ≤100\leq 100

  • s consists of lowercase English letters.