Palindrome Linked List (LeetCode 234): O(1) Space Without Losing the List

Given the head of a singly linked list, return true if it reads the same forward and backward. Easy version: copy to an array Push every value into a list and compare it with its reverse. That's O(n)