Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion LL 2/delete every m node
Original file line number Diff line number Diff line change
Expand Up @@ -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)
{
Expand Down