codingstuff.io
ExploreTutorialsProblemsCS Subjects
Get Started
ExploreTutorialsProblemsCS Subjects
Get Started
codingstuff.io

Master the art of building software through interactive tutorials, real-world problems, and guided projects.

Pune, Maharashtra, India

codingstuffmail@gmail.com

Product

  • Explore
  • Tutorials
  • Problems
  • CS Subjects

Company

  • About
  • Contact
  • Privacy Policy
  • Terms & Conditions
  • Sitemap

© 2026 codingstuff.io. All rights reserved.

Built with ❤️ for developers everywhere

ProblemsPalindrome Linked List

Palindrome Linked List

Easy
Linked ListsTwo Pointers

Given the head of a singly linked list, return true if it is a palindrome or false otherwise.

 

Example 1:

Input: head = [1,2,2,1]
Output: true

Example 2:

Input: head = [1,2]
Output: false

 

Constraints:

  • The number of nodes in the list is in the range [1, 105].
  • 0 <= Node.val <= 9

 

Follow up: Could you do it in O(n) time and O(1) space?

Related Problems

View all
Reverse Linked List
Easy•Linked-lists
Merge Two Sorted Lists
Easy•Linked-lists
Reorder List
Medium•Linked-lists
Remove Nth Node From End of List
Medium•Linked-lists
Copy List with Random Pointer
Medium•Linked-lists
Add Two Numbers
Medium•Linked-lists
Input:
head = [1,2,2,1]