Delete a Node


Problem Statement :


Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value.

Example:
list=0->1->2->3
position=2

After removing the node at position 2, list'= 0->1->-3.


Function Description:

Complete the deleteNode function in the editor below.

deleteNode has the following parameters:
- SinglyLinkedListNode pointer llist: a reference to the head node in the list
- int position: the position of the node to remove

Returns
- SinglyLinkedListNode pointer: a reference to the head of the modified list


Input Format:

The first line of input contains an integer n, the number of elements in the linked list.
Each of the next n lines contains an integer, the node data values in order.
The last line contains an integer, position, the position of the node to delete.


Constraints:
     1.  1<=n<=1000
     2.  1<=list[i]<=1000


Solution :



title-img 


                            Solution in C :

In C:

//the following function is all that is needed to complete
// the challenge in hackerrank platform.

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









In C++:

//the following function is all that is needed to complete
//the challenge in hackerrank platform

Node* Delete(Node *head, int position)
{
  // Complete this method
    Node *prev = NULL;
    Node *ptr = head;
    
    int pos = 0;
    
    if(position==0)
    {
        head=head->next;
        delete (ptr);
    }
    else
    {
        while(position!=pos)
        {
            ++pos;
            prev=ptr;
            ptr=ptr->next;
        }
        
        if(ptr!=NULL)
        {
            prev->next=ptr->next;
            delete (ptr);
        }
    }
    return head;
}









In Java:

//the following method is all that is needed to complete the 
//challenge in hackerrank plartform

static SinglyLinkedListNode deleteNode(SinglyLinkedListNode llist, int position) {
        int currentNodePosition = 0;
        SinglyLinkedListNode head = llist;
        SinglyLinkedListNode currentNode = llist;
        
         if (position == 0) {
            head = head.next;
            return head;
        }
        
        while (currentNodePosition < position - 1) {
            currentNode = currentNode.next;
            currentNodePosition++;
        }
        
        if (currentNode.next != null && currentNode.next.next != null) {
            currentNode.next = currentNode.next.next;
        }
        
        return head;
    }










In Python 3: 

#the following method is all that is needed to complete the
#challenge in hackerrank platfrom

def Delete(head, position):
  currentPos = 0
  prevNode = None
  node = head
  while currentPos < position:
    currentPos = currentPos+1
    prevNode = node
    node = node.next

  if prevNode is not None:
      prevNode.next = node.next
      return head
  else:
      n = node.next
      node.next = None
      return n








View More Similar Problems

No Prefix Set

There is a given list of strings where each string contains only lowercase letters from a - j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked. Note If two strings are identical, they are prefixes of each other. Function Descriptio

View Solution →

Cube Summation

You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor

View Solution →

Direct Connections

Enter-View ( EV ) is a linear, street-like country. By linear, we mean all the cities of the country are placed on a single straight line - the x -axis. Thus every city's position can be defined by a single coordinate, xi, the distance from the left borderline of the country. You can treat all cities as single points. Unfortunately, the dictator of telecommunication of EV (Mr. S. Treat Jr.) do

View Solution →

Subsequence Weighting

A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =

View Solution →

Kindergarten Adventures

Meera teaches a class of n students, and every day in her classroom is an adventure. Today is drawing day! The students are sitting around a round table, and they are numbered from 1 to n in the clockwise direction. This means that the students are numbered 1, 2, 3, . . . , n-1, n, and students 1 and n are sitting next to each other. After letting the students draw for a certain period of ti

View Solution →

Mr. X and His Shots

A cricket match is going to be held. The field is represented by a 1D plane. A cricketer, Mr. X has N favorite shots. Each shot has a particular range. The range of the ith shot is from Ai to Bi. That means his favorite shot can be anywhere in this range. Each player on the opposite team can field only in a particular range. Player i can field from Ci to Di. You are given the N favorite shots of M

View Solution →