## Noisy Palindrome - Facebook Top Interview Questions

You are given a string s containing lowercase and uppercase alphabet characters as well as digits from "0" to "9". Return whether s is a palindrome if we only consider the lowercase alphabet characters. Constraints 0 ≤ n ≤ 100,000 where n is the length of s Example 1 Input s = "a92bcbXa" Output True Explanation If we only consider the lowercase characters, then s is "abcba" which is a palindrome. Example 2 Input s = "abZ" Output False

## Strictly Alternating List - Facebook Top Interview Questions

You are given a list of integers nums. Return whether the list alternates from first strictly increasing to strictly decreasing and then strictly increasing etc. If a list is only strictly increasing, return true. Constraints 2 ≤ n ≤ 100,000 where n is the length of nums Example 1 Input nums = [1, 2, 5, 7, 4, 1, 6, 8, 3, 2] Output True Explanation This list strictly increases, strictly decreases, strictly increases, then strictly decreases. Example 2