Given the head of a linked list, remove the nth node from the end of the list and return its head. Here’s the [Problem Link] to begin with. Example 1: Input: head = [1,2,3,4,5], n = 2Output: [1,2,3,5] Example 2: Input: head = [1], n = 1Output: [] Example 3: Input: head = [1,2], n = 1Output: [1] Constraints: … Continue reading Remove Nth Node From End of List | Leetcode 19