by Pawan Kumar @jsartisan
Write a function that takes two parameters: a linked list starting at node head, and a number n.
Your task is to delete the node that is n positions from the tail of the list, then return the modified list's head node.
Constraints:
- The number of nodes in the list is sz
- 1 ≤ sz ≤ 30
- 0 ≤ Node.val ≤ 100
- 1 ≤ n ≤ sz
Examples:
// Example 1:
const head1 = [1, 2, 3, 4];
const n1 = 2;
console.log(removeNthFromEnd(head1, n1));
// Output: [1, 2, 4]
// Example 2:
const head2 = [5];
const n2 = 1;
console.log(removeNthFromEnd(head2, n2));
// Output: []
// Example 3:
const head3 = [1, 2];
const n3 = 2;
console.log(removeNthFromEnd(head3, n3));
// Output: [2]
