Skip to content

Latest commit

 

History

History

palindrome-linked-list

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
README.md
README.md
 
 
palindrome_linked_list.go
palindrome_linked_list.go
 
 
palindrome_linked_list_test.go
palindrome_linked_list_test.go
 
 

README.md

< Previous 　　　　　　　　　　　　　　　　 Next >

234. Palindrome Linked List (Easy)

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

 

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 Topics

[Stack] [Recursion] [Linked List] [Two Pointers]

Similar Questions

  1. Palindrome Number (Easy)
  2. Valid Palindrome (Easy)
  3. Reverse Linked List (Easy)