From 4220a1a00598a29fcf2113f21a36769affc5f4dd Mon Sep 17 00:00:00 2001
From: joshiii947 <omprakashjoshi947@gmail.com>
Date: Sat, 17 Oct 2020 11:27:31 +0530
Subject: [PATCH] linkedlist

---
 .../datastructures/linkedlists/CompareTwoLinkedLists.java   | 3 +++
 .../datastructures/linkedlists/CycleDetection.java          | 6 +++++-
 2 files changed, 8 insertions(+), 1 deletion(-)

diff --git a/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/linkedlists/CompareTwoLinkedLists.java b/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/linkedlists/CompareTwoLinkedLists.java
index 5f5f646..7d50aef 100644
--- a/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/linkedlists/CompareTwoLinkedLists.java
+++ b/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/linkedlists/CompareTwoLinkedLists.java
@@ -17,6 +17,9 @@ class Node {
 	}
 
 	int CompareLists(Node headA, Node headB) {
+		if(headA==null && headB==null)
+		   return 1;
+		   
 		while (headA != null && headB != null) {
 			if (headA.data != headB.data) {
 				return 0;
diff --git a/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/linkedlists/CycleDetection.java b/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/linkedlists/CycleDetection.java
index ada4c7a..6044d32 100644
--- a/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/linkedlists/CycleDetection.java
+++ b/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/linkedlists/CycleDetection.java
@@ -23,7 +23,11 @@ int HasCycle(Node head) {
 
 		while (p1 != null && p1.next != null && p2 != null) {
 			p1 = p1.next;
-			p2 = p2.next.next;
+			p2 = p2.next;
+			if(p2==null || p1==null)
+			  return 0;
+			p2=p2.next;  
+			  
 			{
 				if (p1 == p2)
 					return 1;