Solving Palindrome Linked List in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

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?

See the full details of the problem Palindrome Linked List at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go