?? Day #45 of My 365 Days Coding Challenge!

?? A Personal Reflection:

Palindromes have always fascinated me—whether it’s words like "madam" or numbers like 121. But have you ever checked if a linked list is a palindrome? ?? Today, I implemented a function to check if a linked list reads the same forward and backward!

?? What I Did Today:

I used Floyd’s Tortoise and Hare Algorithm ???? to find the middle of the linked list, then reversed the second half and compared both halves for a match.

?? Key Learning:

• Floyd’s Algorithm (Fast & Slow Pointer) finds the middle efficiently (O(n)).
• Reversing a Linked List helps in comparing both halves.
• Time Complexity: O(n), Space Complexity: O(1) (in-place reversal).

? Extra Touch:

? Handles even and odd-length lists

? No extra space used (modifies the list temporarily)

? Can be extended to restore the original list after checking!

?? Your Turn:

Modify this to restore the original linked list after checking for a palindrome!

#365DaysOfCode #CodingChallenge #PalindromeCheck