check-ascii-palindromic

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given a string <code>s</code> consisting of lowercase English letters.

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

Return <code>true</code> if the resulting binary string is a palindrome. Otherwise, return <code>false</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: s = &quot;ff&quot;

Output: true

Explanation:

<ul>
	<li>The ASCII value of <code>f</code> is 102, whose 8-bit binary representation is <code>01100110</code>.</li>
	<li>Thus, the binary string is <code>0110011001100110</code>.</li>
	<li>Since this binary string is a palindrome, the output is <code>true</code>.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: s = &quot;leet&quot;

Output: false

Explanation:

<ul>
	<li>The ASCII values of <code>l</code>, <code>e</code>, <code>e</code>, and <code>t</code> are 108, 101, 101, and 116, respectively.</li>
	<li>Their 8-bit binary representations are <code>01101100</code>, <code>01100101</code>, <code>01100101</code>, and <code>01110100</code>.</li>
	<li>Thus, the binary string is <code>01101100011001010110010101110100</code>.</li>
	<li>Since this binary string is not a palindrome, the output is <code>false</code>.</li>
</ul>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 100</code></li>
	<li><code>s</code> consists of lowercase English letters.</li>
</ul>

Weekly Contest 516

weekly-contest-516

isPalindromic

Mid Level

Check ASCII Palindromic

Two Pointers

String

Bit Manipulation

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

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.

 

Example 1:

Input: s = "ff"

Output: true

Explanation:

 * The ASCII value of f is 102, whose 8-bit binary representation is 01100110.
 * Thus, the binary string is 0110011001100110.
 * Since this binary string is a palindrome, the output is true.

Example 2:

Input: s = "leet"

Output: false

Explanation:

 * The ASCII values of l, e, e, and t are 108, 101, 101, and 116, respectively.
 * Their 8-bit binary representations are 01101100, 01100101, 01100101, and 01110100.
 * Thus, the binary string is 01101100011001010110010101110100.
 * Since this binary string is not a palindrome, the output is false.

 

Constraints:

 * 1 <= s.length <= 100
 * s consists of lowercase English letters.