234. Palindrome Linked List

LeetCodeLinked ListTwo PointersStackRecursionOpen on judge ↗

Given the head of a singly linked list, return true if it is a palindrome or false otherwise. Example 1: Input: head = [1,2,2,1] Output: true Example 2: Input: head = [1,2] Output: false Constraints: - The number of nodes in the list is in the range [1, 105]. - 0 <= Node.val <= 9 Follow up: Could you do it in O(n) time and O(1) space?

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI