BinarySearch 1008 Noisy Palindrome

Problem statement

https://binarysearch.com/problems/Noisy-Palindrome/

Solution

Just do what is asked.

Complexity

It is O(n) for time and space.

Code

class Solution:
    def solve(self, s):
        x = [x for x in s if "a" <= x <= "z"]
        return x == x[::-1]