How do you check if a linked list is a palindrome?

class ListNode:
    def __init__(self, val, nxt=None):
        self.val, self.next = val, nxt

def is_palindrome(head):
    slow = fast = head                    # find middle
    while fast and fast.next:
        slow = slow.next
        fast = fast.next.next
    prev = None                           # reverse second half
    while slow:
        slow.next, prev, slow = prev, slow, slow.next
    left, right = head, prev              # compare
    while right:
        if left.val != right.val:
            return False
        left, right = left.next, right.next
    return True


# --- demo ---
def build(vals):
    head = None
    for v in reversed(vals): head = ListNode(v, head)
    return head

print(is_palindrome(build([1, 2, 2, 1])))   # True
print(is_palindrome(build([1, 2, 3])))      # False