DSA - Remove Nth Node From End of List

Problem Given the head of a linked list, remove the n^th node from the end of the list and return its head. List: [1] -> [2] -> [3] -> [4] -> [5] Value of N: 2 Output: [1] -> [2] -> [3] -> [5] Given Code # Definition for singly-linked list....