Palindrome Linked List
Easy
Topics
Given the head of a singly linked list, return true if the sequence of values reads the same forwards and backwards. (The judge passes a plain acyclic list; pos is always -1.)
Example 1
Input: head = [1,2,2,1] Output: true
Example 2
Input: head = [1,2] Output: false
Constraints
- 0 <= number of nodes <= 100
- 0 <= Node.val <= 9
Run ⌘' · Submit ⌘⏎
SensAI