Click here to Skip to main content
15,882,017 members
Please Sign up or sign in to vote.
1.00/5 (2 votes)
Given the head of a linked list, remove the nth node from the end of the list and return its head.
Example 1:


Input: head = [1,2,3,4,5], n = 2
Output: [1,2,3,5]

What I have tried:

Can Someone help me with this problem :)
Posted
Updated 21-Aug-21 20:26pm
Comments
Patrice T 22-Aug-21 0:49am    
I can, but I will not do your homework.
Choose a language, try to solve the problem and comeback when you have a specific problem.

1 solution

Why do you even try to do Leetcode challenges, if you are just going to ask others to do them for you? 19. Remove Nth Node From End of List[^]

While we are more than willing to help those that are stuck, that doesn't mean that we are here to do it all for you! We can't do all the work, you are either getting paid for this, or it's part of your grades and it wouldn't be at all fair for us to do it all for you.

So we need you to do the work, and we will help you when you get stuck. That doesn't mean we will give you a step by step solution you can hand in!
Start by explaining where you are at the moment, and what the next step in the process is. Then tell us what you have tried to get that next step working, and what happened when you did. But getting others to do it for you means you learn nothing useful at all ...

If you are having problems getting started at all, then this may help: How to Write Code to Solve a Problem, A Beginner's Guide[^]
 
Share this answer
 
Comments
Afzaal Ahmad Zeeshan 22-Aug-21 8:54am    
5ed.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900