CareerCup

No one has considered the case when the node to delete is node where there exist cycle.

Use the rear pointer and handle it similar to a normal linked list

Can you please give the code for this?

copy over the rear node, and delete the rear node

void delete(cnode** node){
cnode* temp = (cnode*)malloc(sizeof(cnode));
if(temp==NULL)
return;
temp = node->next ;
node->val = node->next->val ;
node->next = node->next->next;
node->next->next->prev= node;
free(temp);
}