We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Node*Delete(Node*head,intposition){// Complete this methodif(position==0){head=head->next;returnhead;}Node*node=newNode;node=head;for(inti=1;i<position-1;i++){node=node->next;}node->next=node->next->next;returnhead;}
This is my code, and I think that test sets are broken.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Delete a Node
You are viewing a single comment's thread. Return to all comments →
This is my code, and I think that test sets are broken.