Search⌘ K
AI Features

Solution: Palindrome Linked List

Explore how to determine if a singly linked list is a palindrome without altering its structure. Learn to find the middle with fast and slow pointers, reverse the second half for comparison, and restore the list, mastering a space-efficient O(1) approach.

Statement

Given the head of a linked list, your task is to check whether the linked list is a palindrome or not. Return TRUE if the linked list is a palindrome; otherwise, return FALSE.

Note: The original structure of the linked list must remain unchanged before and after the checking process.

Constraints:

Let n be the number of nodes in a linked list.

  • 11 \leq n 500\leq 500

  • 0 ...