Given two character arrays skipChars and inputChars, determine whether inputChars forms a palindrome after removing all characters that appear in skipChars. A palindrome reads the same forwards and backwards.

Your solution must be efficient in memory: do not build the filtered list explicitly. Instead, use two pointers that skip over blocked characters as they scan from both ends. ...