public static SinglyLinkedListNode deleteNode(SinglyLinkedListNode llist, int position) {
        
        if (position == 0) {
            return llist.next;
        }
        
        SinglyLinkedListNode n = llist;
        
        int counter = 0;
        while(counter <= position) {

            if(counter == position -1) {
            
                if(n.next == null) {
                    return llist;
                }
                
                n.next = n.next.next;
                return llist;
            }
            
            n = n.next;
            counter++;
        }
    
        return llist;
    }

 SinglyLinkedListNode* deleteNode(SinglyLinkedListNode* llist, int position) {
      int count=0;
      if(llist==NULL){
          return NULL;
      }
      if(position==0){
          return llist->next;
      }
      SinglyLinkedListNode* temp=llist;
      SinglyLinkedListNode* prev=NULL;
      while (temp!=NULL) {
          if(count==position){
              prev->next=temp->next;
              free(temp);
          }
          count++;
          prev=temp;
          temp=temp->next;
      }
      return llist;
}

def deleteNode(llist, position):
    if position==0:
            return llist.next
    if llist==None:
        return None
    else:
        temp =llist
        temp2=llist.next
        for i in range(position-1):
            
            temp=temp.next
            temp2=temp2.next
        temp.next=temp2.next
        return llist