Remove Nth Node From End of List - JS

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

For 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.
Try to do this in one pass.

Tag

LinkedList, Two Pointers

----------------------------------------------------------------------------------------------------------------------------------------------------------------------------

// Create two pointers.

/** * Definition for singly-linked list. * function ListNode(val) { *     this.val = val; *     this.next = null; * } *//** * @param {ListNode} head * @param {number} n * @return {ListNode} */var removeNthFromEnd = function(head, n) {    if(head.next === null || head === null) {        return null;    }        var slow = head, fast = head;    while(n>0) {        fast = fast.next;        n--;    }        // Remove head situation    if(fast === null) {        return head.next;    }        while(fast.next !== null) {        slow = slow.next;        fast = fast.next;    }        slow.next = slow.next.next;    return head;};

// Make them depart n distance