search

Gyanthakur / GFG_POTD

Add GfG potd fcfs
26 stars 52 forks source link

GFG_POTD_25_SEPT_2024.cpp #207

Open Avnee29 opened 4 weeks ago

Avnee29 commented 4 weeks ago

📝 Description

Given a singly linked list of integers. The task is to check if the given linked list is palindrome or not. Checking if a singly linked list of integers is a palindrome means verifying if the sequence of numbers reads the same from both ends. For instance, 1 -> 2 -> 3 -> 2 -> 1 is a palindrome, while 1 -> 2 -> 3 -> 4 is not.

💡 Enhancement / Feature Request (if applicable)

Efficiency: Implement the check in O(n) time and O(1) space. Error Handling: Add functionality to handle edge cases, such as empty lists or single-node lists. Output: Provide detailed feedback on the check, indicating whether the list is a palindrome and the method used to determine this. Visualization: Include a method to visualize the linked list for better understanding during debugging. Input Flexibility: Allow the function to accept lists in various formats (e.g., arrays) and convert them to linked lists automatically.

github-actions[bot] commented 4 weeks ago

Welcome, @Avnee29! Thanks for raising the issue. Soon the maintainers/owner will review it and provide you with feedback/suggestions. Make sure to star this awesome repository and follow the account!