@@ -0,0 +1,479 @@
+/*%0A  Insert Node at the end of a linked list%0A  head pointer input could be NULL as well for empty list%0A  Node is defined as%0A  class Node %7B%0A     int data;%0A     Node next;%0A  %7D%0A*/%0A    // This is a %22method-only%22 submission.%0A    // You only need to complete this method.%0ANode Reverse(Node head) %7B%0A%0A  Node prev = null;%0A  Node curr = head;%0A  Node next = null;%0A%0A  while(curr != null) %7B%0A    next = curr.next;%0A    curr.next = prev;%0A    prev = curr;%0A%0A    curr = next;%0A  %7D%0A%0A  return prev;%0A%7D%0A

Solve reverse a linked list