Skip to content

problem1.md

Latest commit

 

History

History
13 lines (10 loc) · 553 Bytes

problem1.md

File metadata and controls

13 lines (10 loc) · 553 Bytes

Problem 1: Mirror Validation (Valid Palindrome)

Problem Statement

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.

Input Format

  • A string s.

Example

Input: s = "A man, a plan, a canal: Panama"
Output: True
Explanation: "amanaplanacanalpanama" is a palindrome.