LeetCode has a Medium coding Problem in Its’ Algorithm Section “remove nth node from end of list leetcode python”. Today We are going to solve this problem.
remove nth node from end of list leetcode python
Question
Given the head of a linked list, remove the nth node from the end of the list and return its head.
Examples
Input: head = [1,2,3,4,5], n = 2
Output: [1,2,3,5]
Input: head = [1], n = 1
Output: []
Input: head = [1,2], n = 1
Output: [1]
Constraints:
The number of nodes in the list is sz.
1 <= sz <= 30
0 <= Node.val <= 100
1 <= n <= sz
Follow up: Could you do this in one pass?
Remove nth node from end of list Leetcode Python Solution
The Solution is at https://xhecodesit.com/remove-nth-node-from-end-of-list-leetcode-python/
Top comments (0)