Time: 796 ms (50.48%), Space: 49.2 MB (29.67%) - LeetHub

Author: mardavsj

0234-palindrome-linked-list/0234-palindrome-linked-list.py

@@ -0,0 +1,13 @@
+class Solution:
+    def isPalindrome(self, head: Optional[ListNode]) -> bool:
+        pointer = head
+        arr = []
+        while pointer:
+            arr.append(pointer.val)
+            pointer = pointer.next
+        
+        n = len(arr)
+        for i in range(n//2):
+            if arr[i] != arr[n-1-i]:
+                return False
+        return True