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][//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 share
Related
- Print in Reverse Hackerrank Challenge Java Solution
- In "Solutions"
- Reverse a doubly linked list Hackerrank Challenge Java Solution
- In "Solutions"
- HackerRank Solutions Linked Lists Detect a Cycle Java Solution
- In "Solutions"
See also Time Complexity: Primality - Hackerrank Challenge - Java Solution