š§ Brute Force Approach (Not Optimal) A simple way is: Convert linked list into an array Check if array is palindrome But this uses extra memory: Time: O(n) Space: O(n) ā š§ Optimal Approach 1. Find the Middle of the Linked List We use two poi...

Markdown supported Ā· āāµ to post
No responses yet.