Solution: Palindrome Check using Queue

# The initial soluton did is incorrect. A queue should only remove elements from either the front or the end but not both.

function isPalindrome(s: string): boolean {
    // Normalize the string: convert to lowercase and remove non-alphanumeric characters
    const normalizedStr = s.replace(/[^a-zA-Z0-9]/g, '').toLowerCase();

    // Initialize a queue (array used as a queue) and a stack
    const queue: string[] = [];
    const stack: string[] = [];

    // Add each character of the normalized string to both the queue and the stack
    for (const char of normalizedStr) {
        queue.push(char);
        stack.push(char);
    }

    // Check if the string is a palindrome using the queue and the stack
    while (queue.length > 0) {
        if (queue.shift() !== stack.pop())