Top 50 Linked List Problems for Coding Interviews

Linked Lists is the linear data structure that stores the data in the node. In this article, we will discuss the most common and popular problems of linked lists in Data Structures and Algorithms. We are covering basic to advanced-level problems which will help you to learn the whole concept in a structured manner.

The following are the most important and best problems on linked lists ?

Easy LL Problems

• Print the Middle of a Given Linked List
• Reverse a Linked List
• Detect Loop in a Linked List
• Delete Middle of a Linked List
• Remove Duplicate Elements from a Sorted Linked List
• Remove last occurrence of a given target
• Nth Node from the End of a Linked List
• Rotate a Linked List
• Delete N Nodes After M Nodes of a Linked List
• Merge a Linked List into Another Linked List at Alternate Positions

Medium LL Problems

• Reverse a Doubly Linked List
• Circular Linked List Traversal
• Deletion from a Circular Linked List
• Delete Without Head Pointer
• Implement Queue Using Linked List
• Implement a Stack Using Singly Linked List
• Remove Every k-th Node of a Linked List
• Pairwise Swap of a Linked List
• Occurrence of an Integer in a Linked List using Recursion
• Sort a Linked List of 0s, 1s, and 2s
• Convert Singly Linked List into Circular Linked List
• Reverse a Linked List in Groups of Given Size
• Merge Two Sorted Linked Lists
• Remove Item in a Linked List
• Check if a Singly Linked List is a Palindrome
• Removing first occurrence of specified value from Linked List
• Intersection Point in Linked Lists
• Intersection of Two Sorted Linked Lists
• Split a Circular Linked List into Two Halves
• Find Pairs with Given Sum in a Doubly Linked List

Advanced LL Problems

• Remove Duplicates from an Unsorted Doubly Linked List
• Add Two Numbers Represented by Linked Lists
• Multiply Two Numbers Represented by Linked Lists
• Swap k-th Node from Beginning with k-th Node from End in a Linked List
• Cyclic Path Decomposition in a Linked List
• Rotate Doubly Linked List by N Nodes
• Linked List for Dynamic Partitioning
• Convert a Given Binary Tree to a Doubly Linked List
• Construct a Linked List from a 2D Matrix
• Reverse a Doubly Linked List in Groups of Given Size
• Smallest Range Covering Elements from K Lists
• Rearrange a Given Linked List
• Reverse Alternate k Nodes in a Singly Linked List
• Reverse a Linked List in Groups of Given Size
• Merge k Sorted Linked Lists
• Intersection Point of Two Linked Lists
• Flattening a Linked List
• Partition a Linked List Around a Given Value
• Clone a Linked List with Random Pointers
• Reverse a Linked List in Groups of Given Size (Alternate Approach)