added Palindrome Linked List

[sorohere]

PR Checklist:

• [x] My submission is formatted according to the guidelines in the contributing guide
• [x] My addition is on refer on the language README.md file
• [x] My addition does not have a spelling problem
• [x] My submission has a proper and user-friendly description of the algorithm
• [x] My submission has the time complexity of the algorithm
• [x] My submission has sample input-output of the program (NOT FOR PYTHON)

What kind of change does this PR introduce? (check at least one)

• [ ] Bugfix
• [x] New algorithm
• [ ] Optimization in previous algorithms
• [ ] Code style update
• [ ] Refactor
• [ ] Documentation
• [ ] Other, please describe:

Briefly describe the changes in this PR

In this PR, I have added the implementation of a "Palindrome Linked List" algorithm to the repository. The algorithm checks whether a linked list is a palindrome, meaning it reads the same forwards and backward. The changes include adding the necessary code to perform the palindrome check efficiently and ensuring that the existing codebase remains unaffected. This contribution enhances the repository's functionality and provides a valuable addition for working with linked lists.

[welcome[bot]]

Thanks for opening this pull request! Please check out our contributing guidelines.