Get nth node from end in a linked list
Instead of a count variable and reusing current,
I think it's neater to use two pointers:

Node runner = head;
for (int i = 0; i &lt; n; i++) {
    runner = runner.next;
}
Node current = head;
while (runner.next != null) {
    runner = runner.next;
    current = current.next;
}
return current.data;


Other than that, your implementation is fine, except for a few tiny style points that are barely worth mentioning, but here we go anyway:


The commented out instructions about method-only submissions are unnecessary
Add a space after commas in parameter list