Common Linked List Problems and Solutions in Java
203. Remove Linked List Elements
Given the head of a linked list and an integer val, remove all nodes with value equal to val and return the new head.
public ListNode removeElements(ListNode head, int val) {
while (head != null && head.val == val) {
head = head.next;
}
if (head == null) return null;
ListNode pre ...
Posted on Sat, 09 May 2026 16:06:10 +0000 by glcarlstrom
Solving Common Linked List Problems: Kth-from-End, Palindrome Check, and Intersection Detection
Finding the Kth Node from the End of a Linked List
To locate the kth node from the end efficient, use two pointers—fast and slow. Advance the fast pointer by k steps first. Then move both pointers forward until fast reaches the end. At this point, slow will be pointing to the desired node.
int kthToLast(struct ListNode* head, int k) {
struc ...
Posted on Sat, 09 May 2026 12:56:21 +0000 by csimms
Finding the Intersection Node of Two Linked Lists
Given the head nodes headA and headB of two singly linked lists, determine the node at which the two lists intersect. Return the intersecting node. If no intersection exists, return null.
The linked list structure is guraanteed to be acyclic. The original structure of both lists must remain unchanged after the function returns.
Example 1:
Input ...
Posted on Thu, 07 May 2026 16:21:41 +0000 by eMonk