GoLang Solution For LeetCode Problem: Palindrome Linked List
Solving Palindrome Linked List in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Given a singly linked list, determine if it is a palindrome.
Input: 1->2 Output: false
Input: 1->2->2->1 Output: true
Could you do it in O(n) time and O(1) space?
See the full details of the problem Palindrome Linked List at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go