# LeetCode problem #234: Palindrome Linked List (JavaScript)

## Solution #1: Array of values

Much like in the above explanation, our approach here will be first to loop through the values of the supplied Linked List, adding them to an array, and then to determine whether or not that array represents a palindrome.

## Solution #2: Recursive

In this solution, we first make a recursive call that traverses its way through the supplied Linked List. Then, as each call begins to finish (starting with the final node), we compare it with the original head. In other words, we compare the first node with the last, and then move both inward.

## Solution #3: Reversing the second-half

Another popular approach is to reverse the Linked List from the middle point onwards, and then compare the start and end nodes, moving inwards each time. This can be done using either a recursive or iterative approach, but here we’ve done it iteratively.

--

--

## More from Duncan McArdle

Full-stack software developer from the UK, author of the Aftermath book series, full time tech-nerd.

Love podcasts or audiobooks? Learn on the go with our new app.

## Duncan McArdle

110 Followers

Full-stack software developer from the UK, author of the Aftermath book series, full time tech-nerd.