Linked List Problems: Swapping, Removal, Intersection, and Cycle Detection
Swapping Nodes in Pairs
Problem: Given a linked list, swap every two adjacent nodes and return its head.
Iterative Approach:
class ListNode {
int val;
ListNode next;
ListNode(int val) { this.val = val; }
}
class Solution {
public ListNode swapPairs(ListNode head) {
if (head == null || head.next == null) {
...
Posted on Sat, 09 May 2026 04:52:05 +0000 by psurrena
Linked List Algorithm Implementations
Swapping Nodes in PairsApproach: Using a dummy head nodeLogic: Create a dummy head node to simplify the swapping process. Use a current pointer that moves forward two steps at a time. The loop continues as long as there are at least two more nodes to swap.Implementation:/**
* Definition for singly-linked list.
* struct ListNode {
* int v ...
Posted on Sat, 09 May 2026 03:30:26 +0000 by drorshem