Time: 31 ms (61.89%), Space: 39.4 MB (27.58%) - LeetHub

Author: hogan-tech

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

@@ -0,0 +1,13 @@
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    def isPalindrome(self, head: Optional[ListNode]) -> bool:
+        numList = []
+        while head:
+            numList.append(head.val)
+            head = head.next
+        
+        return numList == numList[::-1]