Delete the Nth node from the end of the given linked list
Asked in the Tech/Managerial Round stage.
For grading, represent the linked list as a list of node values. Implement remove_nth_from_end(head, n) and return the resulting list after removing the node that is n positions from the end. The input always contains at least one node, and n is valid.
def remove_nth_from_end(head, n):