Find 'n'th node from the end of a linked list

[ShivamYadav-Coding]

Feature ✅

Description

Given a linked list, find 'n'th node from the end for a given value of n (n > 0).

Example

For example, for the following linked list

if n = 2, we have to find 2nd node from the end which is node 6. if n = 1, we have to find 1st node from the end which is node 7.

Checklist:

• [x] I have read the project guidelines.
• [x] I have checked all the existing projects, before submitting a new project issue.
• [x] This issue will be meaningful for the project.
• [x] I will contribute more in future

Contributors are supposed to mention their coding language while asking for assignment

[dhruvin5]

can you assign this to me in c++?

[marlonluca]

Can I also work on it, using java?

[almas-ashruff]

Can I solve using C++? Thank you.

[dhairya-parikh]

Can I solve it in JAVA? Thank you.

[pratik-choudhari]

@almas-ashruff @dhairya-parikh They are already assigned, choose another issue.

[Shreejichandra]

Can I solve it in Python? Thank you.