#### Check if a singly linked list is a palindrome.

This technical problem deals with singly linked lists, and specifically with checking if a given singly linked list is a palindrome. A palindrome is defined as a word, phrase , or sequence that reads the same backward as forward, and so in this context, a palindrome linked list would be one where the order of the nodes is the same whether you traverse the list from the beginning or from the end. The input to the function is a singly linked list, and the output is a boolean value indicating whether or not the list is a palindrome.

#### Problem

```Given a singly linked list, write a function to check if the list is a palindrome.
Example input:
1 -> 2 -> 3 -> 2 -> 1
Example output:
True```

#### Solution

This solution is in C++. Our A.I. can create solutions in multiple languages.
by kayakane
```#include <iostream>
#include <stack>

using namespace std;

struct Node {
int data;
Node* next;
};

stack<int> s;
while (temp != NULL) {
s.push(temp->data);
temp = temp->next;
}
return false;
}
s.pop();
}
return true;
}

int main() {