From ca5a2a33e828977b0fd9770fd02a341c3c27fdd5 Mon Sep 17 00:00:00 2001
From: SAMEEP-PUNJANI <91375403+SAMEEP-PUNJANI@users.noreply.github.com>
Date: Thu, 10 Feb 2022 19:39:20 +0530
Subject: [PATCH] Update delete every m node

line number 12 is my edit as the previous code was failing one test case
---
 LL 2/delete every m node | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/LL 2/delete every m node b/LL 2/delete every m node
index de3cb19..e312f7e 100644
--- a/LL 2/delete every m node	
+++ b/LL 2/delete every m node	
@@ -9,7 +9,7 @@ That is, in the given linked list you need to delete N nodes after every M nodes
 node* skipMdeleteN(node  *head, int M, int N) {
     
     if(M==0) return NULL; // edge case  not a base case
-    
+    if(N==0) return head;   // this is another edge case
     //base case
     if(head==NULL ||head->next==NULL) 
     {