Dsa
Linked List
Hard
Palindrome Linked List Check
You are given a linked list and need to determine whether it forms a palindrome. A palindrome is a sequence that reads the same backward as forward.
Input format:
- The first line contains an integer n (1 <= n <= 1000), the number of nodes in the linked list.
- The second line contains n integers, the values of the nodes in the linked list, separated by spaces.
Output format:
- Print 'Yes' if the linked list is a palindrome, or 'No' if it is not.
Example:
Input:
5
1 2 3 2 1
Output:
Yes
Key concepts
linked_listpalindrometwo_pointers
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now