Algorithm · Apple · Easy
Given a string s, determine whether it is a palindrome. Return true when it is; otherwise, return false. A palindrome has identical forward and reverse readings. Letter case does not matter, and any character that is not alphanumeric must be skipped. Note: The alphanumeric set includes letters (A-Z, a-z) and digits (0-9). Examples Example 1: Input: s = "No lemon, no melon!" Output: true Explanation: Keeping just the alphanumeric characters and ignoring case gives…
Checking your access…