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.
  1. Prepare
  2. Data Structures
  3. Linked Lists
  4. Delete a Node
  5. Discussions

Delete a Node

Sort by

recency

|

823 Discussions

|

  • jimenezmyj
     + 0 comments

    Lots off problems with de code given in c#.

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you can have the video explanation here : https://youtu.be/EjWw69vLVYo

    SinglyLinkedListNode* deleteNode(SinglyLinkedListNode* llist, int position) {
    if(position == 0) return llist->next;
    SinglyLinkedListNode* curr = llist;
    while(position - 1) {
        curr = curr -> next;
        position--;
    }
    curr->next = curr->next->next;
    return llist;
}

  • somaditya
     + 0 comments

    simplest python solution:

    def deleteNode(llist, position):
    curr = llist
    prev = llist
    
    if position == 0:
        return llist.next
        
    for i in range(position):
        prev = curr
        curr = curr.next
        
    prev.next = curr.next
    
    return llist

  • akshaypk
     + 0 comments

    My C++ deletion solution:

    SinglyLinkedListNode* deleteNode(SinglyLinkedListNode* llist, int position) {
    SinglyLinkedListNode* ptr = llist;
    
    if (position == 0) {
        SinglyLinkedListNode* ret = llist->next;
        delete llist;
        return ret;
    }
    
    for (int i = 0; i < position-1; i++) {
        ptr = ptr->next;
    }
    
    SinglyLinkedListNode* remove = ptr->next;
    ptr->next = remove->next;
    delete remove;
    
    return llist;
}

  • zxc37984
     + 0 comments
    def deleteNode(llist, position):
    if position == 0:
        return llist.next
    
    cur = llist
    
    while position > 1:
        cur = cur.next
        position -= 1
    cur.next = cur.next.next
    return llist