chore(Java): add delete the kth node from the end

[adityayaduvanshi]

PR Checklist:

• [x] My submission is formatted according to the guidelines in the contributing guide
• [ ] 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

You are given a singly-linked list, delete the kth node from the end of the list and then print Linked list after deletion of the kth node. Other information:

[welcome[bot]]

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