Delete Node in a Linked List

Delete a node from a linked list when you only have access to that node Read full solution .

Detect Cycle in Linked List

Detect if a linked list has a cycle using Floyd's cycle detection algorithm Read full solution .

Circular Linked List Detection

Detect if a linked list has a cycle and find the starting point of the cycle Read full solution .

Find Middle of Linked List

Find the middle node of a linked list using the two-pointer technique Read full solution .

Intersection of Two Linked Lists

Find the intersection node of two linked lists Read full solution .

Merge Two Sorted Lists

Merge two sorted linked lists into one sorted linked list Read full solution .

Palindrome Linked List

Check if a linked list is a palindrome using O(1) extra space Read full solution .

Remove Duplicates from Sorted List

Remove all duplicate values from a sorted linked list Read full solution .

Reverse a Linked List

Reverse a singly linked list in-place Read full solution .

Add two numbers represented as linked lists where digits are stored in reverse order Read full solution .

Copy List with Random Pointer

Create a deep copy of a linked list where each node has a random pointer Read full solution .

Flatten Multilevel Linked List

Flatten a multilevel doubly linked list into a single level Read full solution .

Partition a linked list around a value x such that all nodes less than x come before nodes greater than or equal to x Read full solution .

Remove Nth Node From End of List

Remove the nth node from the end of a linked list in one pass Read full solution .

Reorder a linked list by interleaving nodes from the beginning and end Read full solution .

Rotate a linked list to the right by k places Read full solution .

Sort a linked list in O(n log n) time using constant extra space Read full solution .

Swap every two adjacent nodes in a linked list Read full solution .

Merge k Sorted Linked Lists

Merge k sorted linked lists into one sorted linked list Read full solution .

Reverse Nodes in k-Group

Reverse every k consecutive nodes in a linked list Read full solution .

Linked Lists

Master linked list manipulation with node operations, traversal, and advanced algorithms.

Showing 20 of 20 questions

Filter:

Easy: 0 Medium: 0 Hard: 0

QUESTION	DIFFICULTY
Delete Node in a Linked List Delete a node from a linked list when you only have access to that node	Easy
Detect Cycle in Linked List Detect if a linked list has a cycle using Floyd's cycle detection algorithm	Easy
Circular Linked List Detection Detect if a linked list has a cycle and find the starting point of the cycle	Easy
Find Middle of Linked List Find the middle node of a linked list using the two-pointer technique	Easy
Intersection of Two Linked Lists Find the intersection node of two linked lists	Easy
Merge Two Sorted Lists Merge two sorted linked lists into one sorted linked list	Easy
Palindrome Linked List Check if a linked list is a palindrome using O(1) extra space	Easy
Remove Duplicates from Sorted List Remove all duplicate values from a sorted linked list	Easy
Reverse a Linked List Reverse a singly linked list in-place	Easy
Add Two Numbers Add two numbers represented as linked lists where digits are stored in reverse order	Medium
Copy List with Random Pointer Create a deep copy of a linked list where each node has a random pointer	Medium
Flatten Multilevel Linked List Flatten a multilevel doubly linked list into a single level	Medium
Partition List Partition a linked list around a value x such that all nodes less than x come before nodes greater than or equal to x	Medium
Remove Nth Node From End of List Remove the nth node from the end of a linked list in one pass	Medium
Reorder List Reorder a linked list by interleaving nodes from the beginning and end	Medium
Rotate Linked List Rotate a linked list to the right by k places	Medium
Sort Linked List Sort a linked list in O(n log n) time using constant extra space	Medium
Swap Nodes in Pairs Swap every two adjacent nodes in a linked list	Medium
Merge k Sorted Linked Lists Merge k sorted linked lists into one sorted linked list	Hard
Reverse Nodes in k-Group Reverse every k consecutive nodes in a linked list	Hard

Overview

Linked lists are fundamental data structures that test your understanding of pointers and memory management. This section covers essential linked list operations and algorithms.

Key Concepts

Node structure and pointers
Traversal techniques
Two-pointer (slow/fast) technique
Reversal algorithms
Cycle detection
Merging and splitting

Linked Lists

Overview

Key Concepts

Common Problems

Easy

Medium

Hard

Practice Tips

Resources