solves palindrome linked list

Author: anishLearnsToCode

README.md

@@ -69,7 +69,7 @@
 | 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/InvertBinaryTree.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/invert_binary_tree.py) |
 | 231 | [Power of Two](https://leetcode.com/problems/power-of-two) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/PowerOf2.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/is_power_of_2.py) |
 | 232 | [Implement Queue Using Stacks](https://leetcode.com/problems/implement-queue-using-stacks) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/MyQueue.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/implement_queue_using_stacks.py) | 
-| 234 | [Palindrome Linked Lists](https://leetcode.com/problems/palindrome-linked-list) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/PalindromeLinkedList.java) | 
+| 234 | [Palindrome Linked Lists](https://leetcode.com/problems/palindrome-linked-list) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/PalindromeLinkedList.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/palindrome_linked_list.py) | 
 | 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/LowestCommonAncestorOfBinarySearchTree.java) |
 | 237 | [Delete a Node In A Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/DeleteANodeInLinkedList.java) |
 | 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/ValidAnagram.java) |

python/palindrome_linked_list.py

@@ -0,0 +1,42 @@
+# Definition for singly-linked list.
+from typing import Optional
+
+
+class ListNode:
+    def __init__(self, val=0, next=None):
+        self.val = val
+        self.next = next
+
+
+class Solution:
+    def length(self, head: ListNode) -> int:
+        count = 0
+        while head is not None:
+            count += 1
+            head = head.next
+        return count
+
+    def reverse(self, head: ListNode) -> Optional[ListNode]:
+        if head is None or head.next is None:
+            return head
+        a, b, c = head, head.next, head.next.next
+        a.next = None
+        while c is not None:
+            b.next = a
+            a, b, c = b, c, c.next
+        b.next = a
+        return b
+
+    def isPalindrome(self, head: ListNode) -> bool:
+        list_length = self.length(head)
+        first_half = head
+        second_half = head
+        for i in range((list_length + 1) // 2):
+            second_half = second_half.next
+        second_half = self.reverse(second_half)
+        while second_half is not None:
+            if first_half.val != second_half.val:
+                return False
+            second_half = second_half.next
+            first_half = first_half.next
+        return True