![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1645011310332-Article_180.png\")
<\/p>\n<\/p>\n
The linked list is one of the most important concepts to know while preparing for interviews. Having a good grasp of a linked list can be a huge plus point in coding interviews.<\/p>\n<\/p>\n
We will be given a circular linked list and a position, and we need to delete the element present at that position in the list.<\/p>\n
Note:<\/strong> we need to follow 0 based indexing while deleting the nodes<\/p>\n Let’s try to understand the problem with the help of an example.<\/p>\n If the linked list given to us is: Now, if position = 0<\/strong>. <\/p>\n If the position = 2<\/strong>.<\/p>\n At this point, we have understood the problem statement. Now we will try to formulate an approach for this problem.<\/p>\n Before moving to the approach section, try to think about how you can approach this problem.<\/p>\n Let\u2019s move to the approach section.<\/p>\n We will divide our problem into three sections: 2) When position = length of the list<\/strong> (we need to delete the last node): 3) When we need to delete a middle node: Let’s move to the algorithm section to see the above approach in more depth.<\/p>\n 1) First, calculate the length of the list and save it in len<\/strong> variable.Problem Statement Understanding<\/h3>\n
\n![\"\"](\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/09\/p_1-34.png\")
<\/p>\n\n
\n![\"\"](\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/09\/p_2-33.png\")
<\/li>\n<\/ul>\n\n
\n![\"\"](\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/09\/p_3-19.png\")
<\/li>\n<\/ul>\n\n
Approach<\/h3>\n
\n1) When position = 0<\/strong>:
\na) It means that we need to delete the first node of the circular linked list.
\nb) In this case, we need to reach the last node and then connect it with the second node.
\nc) After that, we will update the head pointer for the list.<\/p>\n
\na) In this case, we need to reach the last second node and connect it with the first node.<\/p>\n
\na) We need to keep track of node position while iterating the list.
\nb) when we find the node at the specified position, we need to connect its previous node with its next node.<\/p>\nAlgorithm<\/h3>\n
\n2) Initialize a variable count<\/strong> by 1.
\n3) If the head<\/strong> is NULL, then it means that the list is empty, so return from the function.
\n4) If the position<\/strong> is less than 0<\/strong> or greater than len<\/strong>, then return from the function.
\n5) If position == 0<\/strong> then, call deleteFirstNode function<\/strong>:<\/p>\n\n
\n
\n6) If position == (len-1)<\/strong> then, call deleteLastNode function<\/strong>:<\/li>\n\n
\n7) Run a while loop till len<\/strong> is positive.<\/li>\n\n
\n8) Return from the function once while loop breaks.<\/li>\n<\/ul>\nDry Run<\/h3>\n
![\"\"](\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/09\/p_4-12.png\")
<\/p>\n![\"\"](\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/09\/p_5-7.png\")
<\/p>\n![\"\"](\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/09\/p_6_7.png\")
<\/p>\nCode Implementation<\/h3>\n\t\t\t\t\t\t