{"id":4701,"date":"2021-09-07T11:27:12","date_gmt":"2021-09-07T11:27:12","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=4701"},"modified":"2022-11-14T09:49:56","modified_gmt":"2022-11-14T09:49:56","slug":"remove-duplicates-from-a-sorted-doubly-linked-list","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/","title":{"rendered":"Remove duplicates from a sorted doubly linked list"},"content":{"rendered":"<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644996679137-123.Remove%20Duplicates%20from%20a%20sorted%20doubly%20linked%20list_Artboard%206.png\" alt=\"\" \/><\/p>\n<p>We know that in the doubly linked list each node stores the link to the previous pointer as well to the next pointer and can be used in the navigation system where both backward and forward traversal is needed. So let&#8217;s just see how to remove duplicates from a sorted doubly linked list<\/p>\n<h2>How to remove duplicates from doubly linked list<\/h2>\n<p>In this problem, we will be given a sorted doubly linked list containing some element occurring multiple times. We have to remove these duplicate occurrences of the elements.<\/p>\n<p>Let\u2019s try to understand how we can remove duplicates from doubly linked list with the help of examples.<\/p>\n<p>Let\u2019s say the given linked list is:<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/09\/input-2.png\" alt=\"\" \/><\/p>\n<ul>\n<li>According to the problem statement, we have to remove duplicates from doubly linked list.<\/li>\n<li>In the given linked list, we can see that  5 and 9 are present multiple times. So, we have to remove duplicates of 5 and 9 present in the linked list.<\/li>\n<li>After removing duplicates of 5 and 9 from the list, the final linked list which we will have is:<\/li>\n<\/ul>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/09\/output-2.png\" alt=\"\" \/><\/p>\n<p>Let\u2019s see if the given linked list is: head \u2192 1 \u2190\u2192 3 \u2190\u2192 3 \u2190\u2192 3 \u2190\u2192 4 \u2190\u2192 5 \u2190\u2192 5 <\/p>\n<ul>\n<li>In this given linked list,  3 and 5 are present multiple times. So, we will remove duplicates of 3 and 5 present in the linked list. Our final linked list after the removal of duplicates of 3 and 5 will be head \u2192 1 \u2190\u2192 3 \u2190\u2192 4 \u2190\u2192 5.<\/li>\n<\/ul>\n<p>Now, I think from the above examples, it is clear what we have to do to remove duplicates from doubly linked list. So let\u2019s see how we can approach it.<\/p>\n<p>Before jumping directly into the approach section, first try to think about how you can remove duplicates from a sorted doubly linked list. If stuck, no problem, we will thoroughly see how we can remove duplicates from doubly linked list in the next section.<\/p>\n<p>Let\u2019s move to the approach section.<\/p>\n<h2>Approach to remove duplicates from doubly linked list<\/h2>\n<p>Our approach will be simple:<\/p>\n<ul>\n<li>We start traversing through the list and will check if the <strong>current\u2192data<\/strong> is equal to the <strong>current\u2192next\u2192data<\/strong> or not:\n<ul>\n<li>If <strong>current\u2192data<\/strong> is not equal to the <strong>current\u2192next\u2192data<\/strong> then we will move forward because it is possible only when there is a single node of the <strong>current\u2192data<\/strong> in the linked list. <\/li>\n<li>But if the <strong>current\u2192data<\/strong> is equal to the <strong>current\u2192next\u2192data<\/strong>, we will delete all node&#8217;s starting from the <strong>current\u2192next<\/strong> up to the node having data same as <strong>current\u2192data<\/strong>. <\/li>\n<\/ul>\n<\/li>\n<li>In the end, our linked list will be free from duplicate elements.<\/li>\n<\/ul>\n<h2>Algorithm to remove duplicates from doubly linked list<\/h2>\n<ul>\n<li>Initialize a pointer named <strong>current<\/strong> with head.<\/li>\n<li>Start traversing through the linked list using <strong>current<\/strong> and do these steps until you reach NULL.\n<ul>\n<li>If the current node\u2019s data is equal to the <strong>current\u2192 next\u2192 data<\/strong>, there are duplicates in the linked list, so we have to delete all the duplicates of <strong>current\u2192 data<\/strong>.<\/li>\n<li>If the current node\u2019s data is not equal to the <strong>current\u2192 next\u2192 data<\/strong>, then move forward by assigning <strong>current = current\u2192 next<\/strong>.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<h3>Dry Run to remove duplicates from a sorted doubly linked list<\/h3>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/09\/Remove-duplicates-from-a-sorted-doubly-linked-list-1.png\" alt=\"\" \/><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/09\/Remove-duplicates-from-a-sorted-doubly-linked-list-2.png\" alt=\"\" \/><\/p>\n<h2>Code Implementation to remove duplicates from a sorted doubly linked list<\/h2>\n\t\t\t\t\t\t<style>\r\n\t\t\t\t\r\n\t\t\t\t\t#tab_container_4702 {\r\n\toverflow:hidden;\r\n\tdisplay:block;\r\n\twidth:100%;\r\n\tborder:0px solid #ddd;\r\n\tmargin-bottom:30px;\r\n\t}\r\n\r\n#tab_container_4702 .tab-content{\r\n\tpadding:20px;\r\n\tborder: 1px solid #e6e6e6 !important;\r\n\tmargin-top: 0px;\r\n\tbackground-color:#ffffff !important;\r\n\tcolor: #000000 !important;\r\n\tfont-size:16px !important;\r\n\tfont-family: Open Sans !important;\r\n\t\r\n\t\tborder: 1px solid #e6e6e6 !important;\r\n\t}\r\n#tab_container_4702 .wpsm_nav-tabs {\r\n    border-bottom: 0px solid #ddd;\r\n}\r\n#tab_container_4702 .wpsm_nav-tabs > li.active > a, #tab_container_4702 .wpsm_nav-tabs > li.active > a:hover, #tab_container_4702 .wpsm_nav-tabs > li.active > a:focus {\r\n\tcolor: #000000 !important;\r\n\tcursor: default;\r\n\tbackground-color: #ffffff !important;\r\n\tborder: 1px solid #e6e6e6 !important;\r\n}\r\n\r\n#tab_container_4702 .wpsm_nav-tabs > li > a {\r\n    margin-right: 0px !important; \r\n    line-height: 1.42857143 !important;\r\n    border: 1px solid #d5d5d5 !important;\r\n    border-radius: 0px 0px 0 0 !important; \r\n\tbackground-color: #e8e8e8 !important;\r\n\tcolor: #000000 !important;\r\n\tpadding: 15px 18px 15px 18px !important;\r\n\ttext-decoration: none !important;\r\n\tfont-size: 14px !important;\r\n\ttext-align:center !important;\r\n\tfont-family: Open Sans !important;\r\n}\r\n#tab_container_4702 .wpsm_nav-tabs > li > a:focus {\r\noutline: 0px !important;\r\n}\r\n\r\n#tab_container_4702 .wpsm_nav-tabs > li > a:before {\r\n\tdisplay:none !important;\r\n}\r\n#tab_container_4702 .wpsm_nav-tabs > li > a:after {\r\n\tdisplay:none !important ;\r\n}\r\n#tab_container_4702 .wpsm_nav-tabs > li{\r\npadding:0px !important ;\r\nmargin:0px;\r\n}\r\n\r\n#tab_container_4702 .wpsm_nav-tabs > li > a:hover , #tab_container_4702 .wpsm_nav-tabs > li > a:focus {\r\n    color: #000000 !important;\r\n    background-color: #e8e8e8 !important;\r\n\tborder: 1px solid #d5d5d5 !important;\r\n\t\r\n}\r\n#tab_container_4702 .wpsm_nav-tabs > li > a .fa{\r\n\r\nmargin-right:5px !important;\r\n\r\nmargin-left:5px !important;\r\n\r\n\r\n}\r\n\r\n\t\t#tab_container_4702 .wpsm_nav-tabs a{\r\n\t\t\tbackground-image: none;\r\n\t\t\tbackground-position: 0 0;\r\n\t\t\tbackground-repeat: repeat-x;\r\n\t\t}\r\n\t\t\t\r\n\r\n\r\n#tab_container_4702 .wpsm_nav-tabs > li {\r\n    float: left;\r\n    margin-bottom: -1px !important;\r\n\tmargin-right:0px !important; \r\n}\r\n\r\n\r\n#tab_container_4702 .tab-content{\r\noverflow:hidden !important;\r\n}\r\n\r\n\r\n@media (min-width: 769px) {\r\n\r\n\t#tab_container_4702 .wpsm_nav-tabs > li{\r\n\t\tfloat:left !important ;\r\n\t\t\t\tmargin-right:-1px !important;\r\n\t\t\t\t\t}\r\n\t#tab_container_4702 .wpsm_nav-tabs{\r\n\t\tfloat:none !important;\r\n\t\tmargin:0px !important;\r\n\t}\r\n\r\n\t#tab_container_4702 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_4702 .wpsm_nav{\r\n\t\t\t}\r\n\r\n}\r\n\r\n\r\n\r\n@media (max-width: 768px) {\r\n\t#tab_container_4702 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_4702 .wpsm_nav{\r\n\t\t\t}\r\n}\r\n\r\n\r\n\t.wpsm_nav-tabs li:before{\r\n\t\tdisplay:none !important;\r\n\t}\r\n\r\n\t@media (max-width: 768px) {\r\n\t\t\t\t\r\n\t\t\t\t.wpsm_nav-tabs{\r\n\t\t\tmargin-left:0px !important;\r\n\t\t\tmargin-right:0px !important; \r\n\t\t\t\r\n\t\t}\r\n\t\t\t\t#tab_container_4702 .wpsm_nav-tabs > li{\r\n\t\t\tfloat:none !important;\r\n\t\t}\r\n\t\t\t\r\n\t}\t\t\t\t<\/style>\r\n\t\t\t\t<div id=\"tab_container_4702\" >\r\n\t \r\n\t\t\t\t\t<ul class=\"wpsm_nav wpsm_nav-tabs\" role=\"tablist\" id=\"myTab_4702\">\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t<li role=\"presentation\"  class=\"active\"  onclick=\"do_resize()\">\r\n\t\t\t\t\t\t\t\t<a href=\"#tabs_desc_4702_1\" aria-controls=\"tabs_desc_4702_1\" role=\"tab\" data-toggle=\"tab\">\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<i class=\"fa fa-code\"><\/i> \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t<span>C++<\/span>\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<\/a>\r\n\t\t\t\t\t\t\t<\/li>\r\n\t\t\t\t\t\t\t\t\t\t\t <\/ul>\r\n\r\n\t\t\t\t\t  <!-- Tab panes -->\r\n\t\t\t\t\t  <div class=\"tab-content\" id=\"tab-content_4702\">\r\n\t\t\t\t\t\t\t\t\t\t\t\t <div role=\"tabpanel\" class=\"tab-pane  in active \" id=\"tabs_desc_4702_1\">\r\n\t\t\t\t\t\t\t\t<!-- wp:enlighter\/codeblock {\"language\":\"cpp\"} -->\r\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\r\n#include <bits\/stdc++.h>\r\nusing namespace std;\r\n\r\nclass DLLNode{\r\npublic:\r\n    int data;\r\n    DLLNode* next;\r\n    DLLNode* prv;\r\n    DLLNode(int data){\r\n        this->data = data;\r\n        this->next = NULL;\r\n        this->prv = NULL;\r\n    }\r\n};\r\n\r\nDLLNode* deleteNodes(DLLNode* head){\r\n    \/\/  initialize the starting and ending node  \r\n    \/\/  which we have to delete\r\n    DLLNode *first = head, *last = head;\r\n    while(last!=NULL && last->next!=NULL && last->data == last->next->data){\r\n        last = last->next; \/\/ move last node to its correct position\r\n    }\r\n\r\n    DLLNode* temp = last->next;\r\n    last->next = NULL;\r\n    first->prv = NULL;\r\n    delete first;\r\n    return temp;\r\n}\r\n\r\nvoid removeDuplicates(DLLNode* head){\r\n    if(head==NULL){\r\n        return;\r\n    }\r\n\r\n    DLLNode *curr = head;\r\n    while(curr->next != NULL){\r\n        if(curr->data != curr->next->data){\r\n            curr = curr->next;\r\n        }else{\r\n           DLLNode* temp = deleteNodes(curr->next);\r\n           curr->next = temp;\r\n           if(temp!=NULL){\r\n           temp->prv = curr;\r\n           }\r\n        }\r\n    }\r\n}\r\n\r\nvoid push(DLLNode** head_ref, int new_data){\r\n    DLLNode* new_node = new DLLNode(new_data);\r\n    new_node->next = (*head_ref);\r\n    (*head_ref) = new_node;\r\n}\r\n\r\nint main(){\r\n\r\n    DLLNode* head = NULL;\r\n    push(&head, 9);\r\n    push(&head, 9);\r\n    push(&head, 9);\r\n    push(&head, 6);\r\n    push(&head, 5);\r\n    push(&head, 5);\r\n    push(&head, 1);\r\n    cout<<\"Original Linked List: \"<<endl;\r\n    for (DLLNode* temp = head; temp != NULL; temp = temp->next)\r\n        cout << temp->data << \" \";\r\n    cout<<endl;\r\n    \r\n    removeDuplicates(head);\r\n    \r\n    cout<<\"Linked List after removing duplicates from a sorted doubly: \"<<endl;\r\n    for (DLLNode* temp = head; temp != NULL; temp = temp->next)\r\n        cout << temp->data << \" \";\r\n \r\n    return 0;\r\n}\r\n<\/pre>\r\n<!-- \/wp:enlighter\/codeblock -->\r\n\t\t\t\t\t\t <\/div>\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t <\/div>\r\n\t\t\t\t\t \r\n\t\t\t\t <\/div>\r\n <script>\r\n\t\tjQuery(function () {\r\n\t\t\tjQuery('#myTab_4702 a:first').tab('show')\r\n\t\t});\r\n\t\t\r\n\t\t\t\tjQuery(function(){\r\n\t\t\tvar b=\"fadeIn\";\r\n\t\t\tvar c;\r\n\t\t\tvar a;\r\n\t\t\td(jQuery(\"#myTab_4702 a\"),jQuery(\"#tab-content_4702\"));function d(e,f,g){\r\n\t\t\t\te.click(function(i){\r\n\t\t\t\t\ti.preventDefault();\r\n\t\t\t\t\tjQuery(this).tab(\"show\");\r\n\t\t\t\t\tvar h=jQuery(this).data(\"easein\");\r\n\t\t\t\t\tif(c){c.removeClass(a);}\r\n\t\t\t\t\tif(h){f.find(\"div.active\").addClass(\"animated \"+h);a=h;}\r\n\t\t\t\t\telse{if(g){f.find(\"div.active\").addClass(\"animated \"+g);a=g;}else{f.find(\"div.active\").addClass(\"animated \"+b);a=b;}}c=f.find(\"div.active\");\r\n\t\t\t\t});\r\n\t\t\t}\r\n\t\t});\r\n\t\t\r\n\r\n\t\tfunction do_resize(){\r\n\r\n\t\t\tvar width=jQuery( '.tab-content .tab-pane iframe' ).width();\r\n\t\t\tvar height=jQuery( '.tab-content .tab-pane iframe' ).height();\r\n\r\n\t\t\tvar toggleSize = true;\r\n\t\t\tjQuery('iframe').animate({\r\n\t\t\t    width: toggleSize ? width : 640,\r\n\t\t\t    height: toggleSize ? height : 360\r\n\t\t\t  }, 250);\r\n\r\n\t\t\t  toggleSize = !toggleSize;\r\n\t\t}\r\n\r\n\r\n\t<\/script>\r\n\t\t\t\t\r\n\t\t\t\n<p><strong>Output<\/strong><\/p>\n<p>Original Linked List:<br \/>\n1 5 5 6 9 9 9<br \/>\nLinked List after removing duplicates from a sorted doubly:<br \/>\n1 5 6 9<\/p>\n<p><strong>Time complexity:<\/strong> O(N), Since we have traversed through the list only once.<\/p>\n<p>So, In this blog, we have learned how to remove duplicates from a sorted doubly linked list. We have discussed whenever we encounter sorted doubly linked lists then how we will remove the data and discuss the approach with a complete dry run and code implementation with optimized time and space complexities. To brush up on skills,you can follow this link <a href=\"https:\/\/mycode.prepbytes.com\/interview-coding\/practice\/linked-list\">Linked List<\/a>.<\/p>\n<p>.<\/p>\n<h2>FAQs to remove duplicates from doubly linked list<\/h2>\n<ol>\n<li><strong>Is a doubly linked list important?<\/strong><\/li>\n<p>A doubly linked list can be used in the navigation system where both backward and forward traversal is needed.<\/p>\n<li><strong>Which operation is more efficient in a doubly linked list?<\/strong><\/li>\n<p>It seems that insertion and deletion are more efficient in a doubly linked list than in a singly linked list.<\/p>\n<li><strong>Is the head a pointer or a node?<\/strong><\/li>\n<p>Head in the case of a singly linked list is the pointer which points to the first node of the linked list.so it\u2019s not a node, it\u2019s a pointer reference.<\/ol><\/p>\n","protected":false},"excerpt":{"rendered":"<p>We know that in the doubly linked list each node stores the link to the previous pointer as well to the next pointer and can be used in the navigation system where both backward and forward traversal is needed. So let&#8217;s just see how to remove duplicates from a sorted doubly linked list How to [&hellip;]<\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[125],"tags":[],"class_list":["post-4701","post","type-post","status-publish","format-standard","hentry","category-linked-list"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v25.8 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Remove duplicates from a sorted doubly linked list<\/title>\n<meta name=\"description\" content=\"Learn the most efficient way to remove duplicates from a sorted doubly linked list. This blog explains how to remove duplicates from the sorted doubly linked list.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Remove duplicates from a sorted doubly linked list\" \/>\n<meta property=\"og:description\" content=\"Learn the most efficient way to remove duplicates from a sorted doubly linked list. This blog explains how to remove duplicates from the sorted doubly linked list.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/\" \/>\n<meta property=\"og:site_name\" content=\"PrepBytes Blog\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/prepbytes0211\/\" \/>\n<meta property=\"article:published_time\" content=\"2021-09-07T11:27:12+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2022-11-14T09:49:56+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644996679137-123.Remove%20Duplicates%20from%20a%20sorted%20doubly%20linked%20list_Artboard%206.png\" \/>\n<meta name=\"author\" content=\"PrepBytes\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"PrepBytes\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"4 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/\"},\"author\":{\"name\":\"PrepBytes\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/39fcf072e04987f16796546f2ca83c2e\"},\"headline\":\"Remove duplicates from a sorted doubly linked list\",\"datePublished\":\"2021-09-07T11:27:12+00:00\",\"dateModified\":\"2022-11-14T09:49:56+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/\"},\"wordCount\":729,\"commentCount\":0,\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644996679137-123.Remove%20Duplicates%20from%20a%20sorted%20doubly%20linked%20list_Artboard%206.png\",\"articleSection\":[\"Linked list articles\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/\",\"url\":\"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/\",\"name\":\"Remove duplicates from a sorted doubly linked list\",\"isPartOf\":{\"@id\":\"http:\/\/43.205.93.38\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644996679137-123.Remove%20Duplicates%20from%20a%20sorted%20doubly%20linked%20list_Artboard%206.png\",\"datePublished\":\"2021-09-07T11:27:12+00:00\",\"dateModified\":\"2022-11-14T09:49:56+00:00\",\"description\":\"Learn the most efficient way to remove duplicates from a sorted doubly linked list. This blog explains how to remove duplicates from the sorted doubly linked list.\",\"breadcrumb\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/#primaryimage\",\"url\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644996679137-123.Remove%20Duplicates%20from%20a%20sorted%20doubly%20linked%20list_Artboard%206.png\",\"contentUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644996679137-123.Remove%20Duplicates%20from%20a%20sorted%20doubly%20linked%20list_Artboard%206.png\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"http:\/\/43.205.93.38\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Linked list articles\",\"item\":\"https:\/\/prepbytes.com\/blog\/category\/linked-list\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Remove duplicates from a sorted doubly linked list\"}]},{\"@type\":\"WebSite\",\"@id\":\"http:\/\/43.205.93.38\/#website\",\"url\":\"http:\/\/43.205.93.38\/\",\"name\":\"PrepBytes Blog\",\"description\":\"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING\",\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"http:\/\/43.205.93.38\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"http:\/\/43.205.93.38\/#organization\",\"name\":\"Prepbytes\",\"url\":\"http:\/\/43.205.93.38\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"contentUrl\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"width\":160,\"height\":160,\"caption\":\"Prepbytes\"},\"image\":{\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/prepbytes0211\/\",\"https:\/\/www.instagram.com\/prepbytes\/\",\"https:\/\/www.linkedin.com\/company\/prepbytes\/\",\"https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA\"]},{\"@type\":\"Person\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/39fcf072e04987f16796546f2ca83c2e\",\"name\":\"PrepBytes\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/850669d326db1e1531f04db0c63145d941c2a26792aaeee226a9e6675b0ac698?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/850669d326db1e1531f04db0c63145d941c2a26792aaeee226a9e6675b0ac698?s=96&d=mm&r=g\",\"caption\":\"PrepBytes\"},\"url\":\"https:\/\/prepbytes.com\/blog\/author\/prepbytes\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Remove duplicates from a sorted doubly linked list","description":"Learn the most efficient way to remove duplicates from a sorted doubly linked list. This blog explains how to remove duplicates from the sorted doubly linked list.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/","og_locale":"en_US","og_type":"article","og_title":"Remove duplicates from a sorted doubly linked list","og_description":"Learn the most efficient way to remove duplicates from a sorted doubly linked list. This blog explains how to remove duplicates from the sorted doubly linked list.","og_url":"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/","og_site_name":"PrepBytes Blog","article_publisher":"https:\/\/www.facebook.com\/prepbytes0211\/","article_published_time":"2021-09-07T11:27:12+00:00","article_modified_time":"2022-11-14T09:49:56+00:00","og_image":[{"url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644996679137-123.Remove%20Duplicates%20from%20a%20sorted%20doubly%20linked%20list_Artboard%206.png","type":"","width":"","height":""}],"author":"PrepBytes","twitter_card":"summary_large_image","twitter_misc":{"Written by":"PrepBytes","Est. reading time":"4 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/#article","isPartOf":{"@id":"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/"},"author":{"name":"PrepBytes","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/39fcf072e04987f16796546f2ca83c2e"},"headline":"Remove duplicates from a sorted doubly linked list","datePublished":"2021-09-07T11:27:12+00:00","dateModified":"2022-11-14T09:49:56+00:00","mainEntityOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/"},"wordCount":729,"commentCount":0,"publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644996679137-123.Remove%20Duplicates%20from%20a%20sorted%20doubly%20linked%20list_Artboard%206.png","articleSection":["Linked list articles"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/","url":"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/","name":"Remove duplicates from a sorted doubly linked list","isPartOf":{"@id":"http:\/\/43.205.93.38\/#website"},"primaryImageOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/#primaryimage"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644996679137-123.Remove%20Duplicates%20from%20a%20sorted%20doubly%20linked%20list_Artboard%206.png","datePublished":"2021-09-07T11:27:12+00:00","dateModified":"2022-11-14T09:49:56+00:00","description":"Learn the most efficient way to remove duplicates from a sorted doubly linked list. This blog explains how to remove duplicates from the sorted doubly linked list.","breadcrumb":{"@id":"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/#primaryimage","url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644996679137-123.Remove%20Duplicates%20from%20a%20sorted%20doubly%20linked%20list_Artboard%206.png","contentUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644996679137-123.Remove%20Duplicates%20from%20a%20sorted%20doubly%20linked%20list_Artboard%206.png"},{"@type":"BreadcrumbList","@id":"https:\/\/prepbytes.com\/blog\/remove-duplicates-from-a-sorted-doubly-linked-list\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"http:\/\/43.205.93.38\/"},{"@type":"ListItem","position":2,"name":"Linked list articles","item":"https:\/\/prepbytes.com\/blog\/category\/linked-list\/"},{"@type":"ListItem","position":3,"name":"Remove duplicates from a sorted doubly linked list"}]},{"@type":"WebSite","@id":"http:\/\/43.205.93.38\/#website","url":"http:\/\/43.205.93.38\/","name":"PrepBytes Blog","description":"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING","publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"http:\/\/43.205.93.38\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"http:\/\/43.205.93.38\/#organization","name":"Prepbytes","url":"http:\/\/43.205.93.38\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/","url":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","contentUrl":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","width":160,"height":160,"caption":"Prepbytes"},"image":{"@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/prepbytes0211\/","https:\/\/www.instagram.com\/prepbytes\/","https:\/\/www.linkedin.com\/company\/prepbytes\/","https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA"]},{"@type":"Person","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/39fcf072e04987f16796546f2ca83c2e","name":"PrepBytes","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/850669d326db1e1531f04db0c63145d941c2a26792aaeee226a9e6675b0ac698?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/850669d326db1e1531f04db0c63145d941c2a26792aaeee226a9e6675b0ac698?s=96&d=mm&r=g","caption":"PrepBytes"},"url":"https:\/\/prepbytes.com\/blog\/author\/prepbytes\/"}]}},"_links":{"self":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/4701","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/comments?post=4701"}],"version-history":[{"count":9,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/4701\/revisions"}],"predecessor-version":[{"id":10464,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/4701\/revisions\/10464"}],"wp:attachment":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/media?parent=4701"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/categories?post=4701"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/tags?post=4701"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}