Delete Node in a Linked List Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, the linked list should become 1 -> 2 -> ...
0215-kth-largest-element-in-an-array.cpp 0217-contains-duplicate.cpp 0219-contains-duplicate-ii.cpp 0221-maximal-square.cpp 0225-implement-stack-using-queues.cpp 0226-invert-binary-tree.cpp 0230-kth-smallest-element-in-a-bst.cpp 0234-palindrome-linked-list.cpp 0235-lowest-common-ancestor-of-a...
0151-Reverse-Words-in-a-String 0153-Find-Minimum-in-Rotated-Sorted-Array 0155-Min-Stack 0159-Longest-Substring-with-At-Most-Two-Distinct-Characters 0160-Intersection-of-Two-Linked-Lists 0161-One-Edit-Distance 0167-Two-Sum-II-Input-array-is-sorted 0169-Majority-Elem...