Reverse a list hackerrank solution in Java
|
Advertisements This is the Java solution for the Hackerrank problem Reverse a linked list Hackerrank Challenge Java Solution. Source Java-aids repository. /**
*
* Problem Statement-
* [Reverse a linked list](https://www.hackerrank.com/challenges/reverse-a-linked-list/problem)
*
*/
package com.javaaid.hackerrank.solutions.datastructures.linkedlists;
/**
* @author Kanahaiya Gupta
*
*/
public class ReverseALinkedList {
class Node {
int data;
Node next;
}
Node Reverse(Node head) {
if (head == null || head.next == null)
return head;
Node remaing = Reverse(head.next);
head.next.next = head;
head.next = null;
return remaing;
}
}
Curly hair, very fair, please shareRelated
See also Time Complexity: Primality - Hackerrank Challenge - Java Solution |
