BL
U

65. Palindrome Linked List Check

Easy

Problem Description

Determine whether a given singly linked list of NN integers is a palindrome.

Input Format

  • •Line 1: An integer NN (1≤N≤1051 \le N \le 10^5).
  • •Line 2: NN space-separated integers.

Output Format

Print true if the list is a palindrome, else false.

Example 1:
Input:
4
1 2 2 1
Output:
true
Explanation: 1 2 2 1 reads the same forwards and backwards.
Example 2:
Input:
2
1 2
Output:
false
Explanation: 1 2 is not a palindrome.
Example 3:
Input:
3
1 0 1
Output:
true
Explanation: 1 0 1 is a palindrome.
Constraints:
  • Standard integer bounds: 32-bit signed integer or input range [1, 10^5].
  • Time complexity target: O(N) or O(N log N) where applicable.
  • Auxiliary space target: O(1) or minimal auxiliary memory.
Follow up:Can this algorithm be adapted to an online streaming setting where the entire input cannot be held in memory simultaneously?
1,180 Online