[19] Remove Nth Node From End of List

https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/

• algorithms
• Medium (33.63%)
• Source Code: 19.remove-nth-node-from-end-of-list.py
• Total Accepted: 377.1K
• Total Submissions: 1.1M
• Testcase Example: '[1,2,3,4,5]\n2'

Given a linked list, remove the n-th node from the end of list and return its head.

Example:

Given linked list: 1->2->3->4->5, and n = 2.

After removing the second node from the end, the linked list becomes 1->2->3->5.

Note:

Given n will always be valid.

Follow up:

Could you do this in one pass?

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def removeNthFromEnd(self, head, n):
        """
        :type head: ListNode
        :type n: int
        :rtype: ListNode
        """