Valid Palindrome Leetcode Solution

Hello Programmers, In this post you will know how to solve the Valid Palindrome Leetcode Solution problem of Leetcode. This Leetcode problem is done in many programming languages like C++, Java, and Python.

Valid Palindrome Leetcode Solution
Valid Palindrome Leetcode Solutions

One more thing to add, don’t directly look for the solutions, first try to solve the problems of Leetcode by yourself. If you find any difficulty after trying several times, then you can look for solutions.


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.


  • 1 <= s.length <= 2 * 105
  • s consists only of printable ASCII characters.

Valid Palindrome Leetcode Solutions in Python

Valid Palindrome Leetcode Solutions in CPP

Valid Palindrome Leetcode Solutions in Java

Note: This problem Valid Palindrome is generated by Leetcode but the solution is provided by BrokenProgrammers. This tutorial is only for Educational and Learning purposes.

Next: Binary Tree Maximum Path Sum Leetcode Solution

Leave a Reply

Your email address will not be published. Required fields are marked *