Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    125 - Valid Palindrome\.

    Easy

    A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers.

    Given a string s, return true if it is a palindrome , or false otherwise.

    Example 1:

    Input: s = "A man, a plan, a canal: Panama"

    Output: true

    Explanation: "amanaplanacanalpanama" is a palindrome.

    Example 2:

    Input: s = "race a car"

    Output: false

    Explanation: "raceacar" is not a palindrome.

    Example 3:

    Input: s = " "

    Output: true

    Explanation: s is an empty string "" after removing non-alphanumeric characters. Since an empty string reads the same forward and backward, it is a palindrome.

    Constraints:

    • <code>1 <= s.length <= 2 * 10<sup>5</sup></code>

    • s consists only of printable ASCII characters.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description
    • Field Summary

      Fields 
      Modifier and Type Field Description
    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()
    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description
    • Method Summary

      Modifier and Type Method Description
      final Boolean isPalindrome(String s)
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait