README ¶ < Previous Next > 234. Palindrome Linked List (Easy) Given a singly linked list, determine if it is a palindrome. Example 1: Input: 1->2 Output: false Example 2: Input: 1->2->2->1 Output: true Follow up: Could you do it in O(n) time and O(1) space? Related Topics [Linked List] [Two Pointers] Similar Questions Palindrome Number (Easy) Valid Palindrome (Easy) Reverse Linked List (Easy) Expand ▾ Collapse ▴ Documentation ¶ There is no documentation for this package. Source Files ¶ View all Source files palindrome_linked_list.go Click to show internal directories. Click to hide internal directories.