Two pointers on one singly linked list: one moves twice as fast, or starts k nodes ahead. One walk finds the middle or the k-th node from the end, and checks for a palindrome in O(1) space, where the naive way counts the length first or copies to an array.
This interactive visualization needs JavaScript.