Palindrome Linked List - Amazon Top Interview Questions

                        Solution in C++ :

bool checkPalindrome(LLNode *node, LLNode **curr) {
    if (node == NULL) return true;
    bool check = checkPalindrome(node->next, curr);
    if (node->val != (*curr)->val) return false;
    *curr = (*curr)->next;
    return check;
}
bool solve(LLNode *node) {
    LLNode *curr = node;
    return checkPalindrome(node, &curr);
}
                    

                        Solution in Python : 
                            
class Solution:
    def solve(self, node):
        fast, slow = node, node
        while fast and fast.next:
            fast = fast.next.next
            slow = slow.next

        right = None
        while slow:
            p = slow.next
            slow.next = right
            right = slow
            slow = p

        left = node
        while left is not None and right is not None:
            if left.val != right.val:
                return False
            left = left.next
            right = right.next
        return True