public static int getLength(Node head)
{
  Node cur = head;
  int length = 0;
  while(curr != null)
  {
    length++;
    cur = curr.next;
  }
  return length;
}

public static void removeNth(Node head, int n, int length)
{
  int nthToLast = length - n;
  if(nthToLast < 0)
  {
    System.out.println("Invalid removal value");
    return;
  }
  
  int iterator = 0;
  Node curr = head;
  while(iterator != nthToLast - 1)
  {
    curr = curr.next;
    iterator++;
  }
  curr.next = curr.next.next;
}

public static void main (String[] args)
{
  // add function calls here
}

@@ -1,20 +1,40 @@
+import java.util.*%0A%0A
 public static int ge
@@ -561,33 +561,222 @@
 %7B%0A  
-// add function calls here
+List list = new List();%0A  list.head = addElements(list); //arbitrary function that adds to the list and returns the head%0A  int sizeOf;%0A  sizeOf = getLength(list.head);%0A  int n = 3;%0A  removeNth(list.head, n, sizeOf);
 %0A%7D%0A

Update 2point2.java