{"id":6891,"date":"2022-07-04T23:15:00","date_gmt":"2022-07-04T17:45:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=6891"},"modified":"2022-07-03T01:21:44","modified_gmt":"2022-07-02T19:51:44","slug":"delete-node-in-a-linked-list-leetcode-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/delete-node-in-a-linked-list-leetcode-solution\/","title":{"rendered":"Delete Node in a Linked List &#8211; Leetcode Solution"},"content":{"rendered":"\n<p>In this post, we are going to solve the<strong> 237. Delete Node in a Linked List<\/strong> problem of Leetcode. This problem <strong>237. Delete Node in a Linked List<\/strong> is a Leetcode <strong>easy <\/strong>level problem. Let&#8217;s see the code, <strong><strong>237. Delete Node in a Linked List<\/strong><\/strong> <strong>&#8211; Leetcode Solution<\/strong>.<\/p>\n\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_65 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<label for=\"ez-toc-cssicon-toggle-item-662efe4cebedc\" class=\"ez-toc-cssicon-toggle-label\"><label class=\"ez-toc-title\">Table of Contents<\/label>\n<span class=\"ez-toc-cssicon\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #0090ff;color:#0090ff\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #0090ff;color:#0090ff\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/label><input type=\"checkbox\"  id=\"ez-toc-cssicon-toggle-item-662efe4cebedc\" checked \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><ul class='ez-toc-list-level-2' ><li class='ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.codingbroz.com\/delete-node-in-a-linked-list-leetcode-solution\/#Problem\" title=\"Problem\">Problem<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.codingbroz.com\/delete-node-in-a-linked-list-leetcode-solution\/#Example_1\" title=\"Example 1 :\">Example 1 :<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.codingbroz.com\/delete-node-in-a-linked-list-leetcode-solution\/#Example_2\" title=\"Example 2 :\">Example 2 :<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/www.codingbroz.com\/delete-node-in-a-linked-list-leetcode-solution\/#Constraints\" title=\"Constraints\">Constraints<\/a><\/li><\/ul><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-1'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/www.codingbroz.com\/delete-node-in-a-linked-list-leetcode-solution\/#Delete_Node_in_a_Linked_List_%E2%80%93_Leetcode_Solution\" title=\"Delete Node in a Linked List &#8211; Leetcode Solution\">Delete Node in a Linked List &#8211; Leetcode Solution<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/www.codingbroz.com\/delete-node-in-a-linked-list-leetcode-solution\/#237_Delete_Node_in_a_Linked_List_%E2%80%93_Solution_in_Java\" title=\"237. Delete Node in a Linked List &#8211; Solution in Java\">237. Delete Node in a Linked List &#8211; Solution in Java<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-7\" href=\"https:\/\/www.codingbroz.com\/delete-node-in-a-linked-list-leetcode-solution\/#237_Delete_Node_in_a_Linked_List_%E2%80%93_Solution_in_C\" title=\"237. Delete Node in a Linked List &#8211; Solution in C++\">237. Delete Node in a Linked List &#8211; Solution in C++<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-8\" href=\"https:\/\/www.codingbroz.com\/delete-node-in-a-linked-list-leetcode-solution\/#237_Delete_Node_in_a_Linked_List_%E2%80%93_Solution_in_Python\" title=\"237. Delete Node in a Linked List &#8211; Solution in Python\">237. Delete Node in a Linked List &#8211; Solution in Python<\/a><\/li><\/ul><\/li><\/ul><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Problem\"><\/span><strong>Problem<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Write a function to <strong>delete a node<\/strong> in a singly-linked list. You will <strong>not<\/strong> be given access to the head of the list, instead, you will be given access to <strong>the node to be deleted<\/strong> directly.<\/p>\n\n\n\n<p>It is <strong>guaranteed<\/strong> that the node to be deleted is <strong>not a tail node<\/strong> in the list.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Example_1\"><\/span><strong>Example 1 :<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>Input: head = &#91;4,5,1,9], node = 5\nOutput: &#91;4,1,9]\nExplanation: You are given the second node with value 5, the linked list should become 4 -&gt; 1 -&gt; 9 after calling your function.<\/code><\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Example_2\"><\/span><strong>Example 2 :<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>Input: head = &#91;4,5,1,9], node = 1\nOutput: &#91;4,5,9]\nExplanation: You are given the third node with value 1, the linked list should become 4 -&gt; 5 -&gt; 9 after calling your function.<\/code><\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Constraints\"><\/span><strong>Constraints<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<ul><li>The number of the nodes in the given list is in the range <code>[2, 1000]<\/code>.<\/li><li><code>-1000 &lt;= Node.val &lt;= 1000<\/code><\/li><li>The value of each node in the list is <strong>unique.<\/strong><\/li><li>The <code>node<\/code> to be deleted is <strong>in the list<\/strong> and is <strong>not a tail<\/strong> node<\/li><\/ul>\n\n\n\n<p>Now, let&#8217;s see the code of <strong><strong>237. Delete Node in a Linked List<\/strong><\/strong> &#8211; Leetcode Solution.<\/p>\n\n\n\n<h1 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Delete_Node_in_a_Linked_List_%E2%80%93_Leetcode_Solution\"><\/span><strong><strong>Delete Node in a Linked List &#8211; Leetcode Solution<\/strong><\/strong><span class=\"ez-toc-section-end\"><\/span><\/h1>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"237_Delete_Node_in_a_Linked_List_%E2%80%93_Solution_in_Java\"><\/span><strong><strong><strong><strong><strong>237. Delete Node in a Linked List<\/strong><\/strong><\/strong><\/strong> &#8211; Solution in Java<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"java\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\/**\n * Definition for singly-linked list.\n * public class ListNode {\n *     int val;\n *     ListNode next;\n *     ListNode(int x) { val = x; }\n * }\n *\/\npublic class Solution {\n        public void deleteNode(ListNode node) {\n            if(node != null &amp;&amp; node.next != null) {\n                node.val = node.next.val;\n                node.next = node.next.next;\n            }\n        }\n    }<\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"237_Delete_Node_in_a_Linked_List_%E2%80%93_Solution_in_C\"><\/span><strong><strong><strong><strong><strong><strong>237. Delete Node in a Linked List<\/strong><\/strong><\/strong><\/strong> &#8211; Solution in <\/strong>C++<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\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=\"\">\/**\n * Definition for singly-linked list.\n * struct ListNode {\n *     int val;\n *     ListNode *next;\n *     ListNode(int x) : val(x), next(NULL) {}\n * };\n *\/\nclass Solution {\npublic:\n    void deleteNode(ListNode* node) {\n        ListNode*  temp = node->next;\n        node->val = temp->val;\n        node->next = temp->next;\n        \n       delete temp;\n    }\n};<\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"237_Delete_Node_in_a_Linked_List_%E2%80%93_Solution_in_Python\"><\/span><strong><strong><strong><strong><strong><strong><strong>237. Delete Node in a Linked List<\/strong><\/strong><\/strong><\/strong> &#8211; Solution in <\/strong><\/strong>Python<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\"># Definition for singly-linked list.\n# class ListNode(object):\n#     def __init__(self, x):\n#         self.val = x\n#         self.next = None\n\nclass Solution(object):\n    def deleteNode(self, node):\n        node.val = node.next.val\n        node.next = node.next.next<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong><strong><a href=\"https:\/\/leetcode.com\/problems\/delete-node-in-a-linked-list\/\" target=\"_blank\" rel=\"noreferrer noopener\">237. Delete Node in a Linked List<\/a><\/strong><\/strong> is generated by <strong><a href=\"https:\/\/leetcode.com\/\" target=\"_blank\" rel=\"noreferrer noopener\">Leetcode<\/a> <\/strong>but the solution is provided by <strong><a href=\"https:\/\/www.codingbroz.com\/\">CodingBroz<\/a><\/strong>. This tutorial is only for <strong>Educational<\/strong> and <strong>Learning<\/strong> purpose.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In this post, we are going to solve the 237. Delete Node in a Linked List problem of Leetcode. This problem 237. Delete Node in a Linked List is a Leetcode easy level problem. Let&#8217;s see the code, 237. Delete Node in a Linked List &#8211; Leetcode Solution.<\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[688],"tags":[713,130,689],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6891"}],"collection":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=6891"}],"version-history":[{"count":3,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6891\/revisions"}],"predecessor-version":[{"id":6898,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6891\/revisions\/6898"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=6891"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=6891"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=6891"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}