logoNEURAL COOK
SearchAll PostsTagsNotesAuthor
logoNEURAL COOK

A posts created with Next.js and Tailwind.css

Explore

  • All posts
  • Notes
  • Snippets
  • Tags
  • RSS feed

Connect

instagramtwitterfacebookyoutubelinkedinmailgithub

© 2026 VIKI. All rights reserved.

Built with
Contents
Table Of Contents
2. Add Two Numbers3. Longest Substring Without Repeating Characters5. Longest Palindromic Substring8. String to Integer (atoi)11. Container With Most Water15. 3Sum17. Letter Combinations of a Phone Number19. Remove Nth Node From End of List22. Generate Parentheses33. Search in Rotated Sorted Array34. Find First and Last Position of Element in Sorted Array48. Rotate Image49. Group Anagrams50. Pow(x, n)53. Maximum Subarray54. Spiral Matrix56. Merge Intervals61. Rotate List73. Set Matrix Zeroes74. Search a 2D Matrix75. Sort Colors78. Subsets137. Single Number II138. Copy List with Random Pointer150. Evaluate Reverse Polish Notation151. Reverse Words in a String153. Find Minimum in Rotated Sorted Array155. Min Stack162. Find Peak Element169. Majority Element198. House Robber207. Course Schedule215. Kth Largest Element in an Array227. Basic Calculator II236. Lowest Common Ancestor of a Binary Tree237. Delete Node in a Linked List238. Product of Array Except Self451. Sort Characters By Frequency540. Single Element in a Sorted Array560. Subarray Sum Equals K636. Exclusive Time of Functions875. Koko Eating Bananas1011. Capacity To Ship Packages Within D Days1101. The Earliest Moment When Everyone Become Friends1283. Find the Smallest Divisor Given a Threshold2140. Solving Questions With Brainpower3169. Count Days Without Meetings3481. Apply Substitutions
Code Scratch/leetcode/medium

237. Delete Node in a Linked List

1 min read
On this pageIntuition
IntuitionComplexityCode

# Intuition

Since we don't have access to the head of the list, and we’re told the node to be deleted is not the last one, the only way to "delete" the node is to copy the value from the next node into the current node, and then skip the next node.

Effectively, we're replacing the current node with the next node and removing the next node instead.

# Complexity

Space ComplexityTime Complexity
O(1)\text{O}(1)O(1)O(N)\text{O}(N)O(N)

# Code

public void deleteNode(ListNode nodeToDelete) {
    // 'currentNode' is the node we want to delete
    // 'nextNode' is the node right after 'currentNode'
    ListNode currentNode = nodeToDelete;
    ListNode nextNode = nodeToDelete.next;
 
    // Shift all the values left by copying next node's value to current
    while (nextNode.next != null) {
        currentNode.val = nextNode.val;
        currentNode = nextNode;
        nextNode = nextNode.next;
    }
 
    // Copy the value of the last node
    currentNode.val = nextNode.val;
    
    // Remove the last node
    currentNode.next = null;
}
 
←Previous236. Lowest Common Ancestor of a Binary TreeNext→238. Product of Array Except Self

On this page

IntuitionComplexityCode