DSA SectionEasy

Palindrome Linked List

Detailed guide and Python implementation for the 'Palindrome Linked List' problem.

Problem Statement

Easy

Write a function is_palindrome_list(arr) that represents a singly linked list as a Python list arr, and returns True if it is a palindrome, and False otherwise.

Constraints
  • 0 <= len(arr) <= 10^5
  • 0 <= arr[i] <= 9

Examples

Example 1
Input
arr = [1, 2, 2, 1]
Output
True
Explanation

The list reads the same forward and backward.

Example 2
Input
arr = [1, 2, 3]
Output
False
Explanation

The list reads [1, 2, 3] forward but [3, 2, 1] backward, which is not equal.

Need a Hint?
Consider using Linked Lists-specific data structures like sets or heaps.
Edge Cases to Watch
  • Empty input structures
  • Single element inputs
  • Large numerical bounds

Ready to Solve?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

Open in Editor

Recommended Python Resources

Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.