Method removeNthfromEnd

12_LinkedList.java/LL.java:152–174

(int n)

    }

    public void removeNthfromEnd(int n) {
         //size
         int size = 0;
         Node temp = head;
         while(temp != null) {
             temp = temp.next;
             size++;
         }
         //if we have to remove the head
         if(n == size) {
             head = head.next;
             return;
         }
         
         int i = 1;
         int itf = size-n;
         Node prev = head;
         while(i < itf) { //try to find the node previous of nth
             prev = prev.next;
             i++;
         }
         prev.next = prev.next.next; 
    }

    private Node findMidNode(Node head) {
        Node slow = head;