Top 50 Problems on Linked List Data Structure asked in SDE Interviews Last Updated : 20 Feb, 2025 Comments Improve Suggest changes Like Article Like Report A Linked List is a linear data structure that looks like a chain of nodes, where each node is a different element. Unlike Arrays, Linked List elements are not stored at a contiguous location. Here is the collection of the Top 50 list of frequently asked interview questions on Linked Lists. Problems in this Article are divided into three Levels so that readers can practice according to the difficulty level step by step. To learn more about Linked List, please refer to the Tutorial on Linked List.Linked List Interview QuestionsEasy ProblemsPrint the Middle of a given linked listReverse a Linked ListReverse a Doubly Linked ListRotate a linked listNth node from end of linked listDelete last occurrence of an item from linked listDelete middle of linked listRemove duplicate elements from sorted linked listDetect Loop in linked listDelete N nodes after M nodes of a linked listMerge a linked list into another linked list at alternate positionsCircular Linked List TraversalDeletion from a Circular Linked ListDelete without head pointerImplement Queue using Linked ListImplement a stack using singly linked listRemove every k-th node of the linked listPairwise swap of a Linked listOccurrence of an integer in a Linked ListGiven a Linked list of 0s, 1s and 2s, sort itDeletion in Linked ListMedium ProblemsConvert singly linked list into circular linked listReverse a linked list in groups of given sizeMerge two sorted linked listsRemove loop in Linked ListFunction to check if a singly linked list is palindromeRemove all occurrences of one Linked list in another Linked listIntersection point in Y shaped Linked listsIntersection of two Sorted Linked ListsSplit a Circular Linked List into two halvesFind pairs with given sum in doubly linked listRemove duplicates from an unsorted doubly linked listIntersection point of two Linked ListsAdd two numbers represented by Linked listsMultiply two numbers represented by Linked ListsSwap Kth node from beginning with Kth node from end in a Linked ListSort a k sorted doubly linked listRotate Doubly linked list by N nodesConvert a Binary Tree into Doubly Linked List in spiral fashionConvert a given Binary Tree to Doubly Linked ListConstruct a linked list from 2D matrixReverse a doubly linked list in groups of given sizeHard ProblemsReverse a sublist of linked listRearrange a given linked list in-placeReverse Alternate K Nodes in a Singly Linked ListReverse a Linked List in groups of given sizeMerge k Sorted Linked ListsFlattening a Linked ListPartition a linked list around a given valueClone a linked list with random pointersSome other important TutorialsDSA TutorialSystem Design TutorialSoftware Development RoadmapRoadmap to become a Product ManagerLearn SAPLearn SEO Comment More infoAdvertise with us kartik Follow Improve Article Tags : Linked List DSA interview-preparation placement preparation Practice Tags : Linked List Similar Reads Linked List Data Structure A linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List: 3 min read Basic Terminologies of Linked List Linked List is a linear data structure, in which elements are not stored at a contiguous location, rather they are linked using pointers. Linked List forms a series of connected nodes, where each node stores the data and the address of the next node.Node Structure: A node in a linked list typically 2 min read Introduction to Linked List - Data Structure and Algorithm Tutorials Linked List is basically chains of nodes where each node contains information such as data and a pointer to the next node in the chain. It is a popular data structure with a wide range of real-world applications. Unlike Arrays, Linked List elements are not stored at a contiguous location. In the lin 9 min read Applications, Advantages and Disadvantages of Linked List A Linked List is a linear data structure that is used to store a collection of data with the help of nodes. Please remember the following points before moving forward.The consecutive elements are connected by pointers / references.The last node of the linked list points to null.The entry point of a 4 min read Linked List vs Array Array: Arrays store elements in contiguous memory locations, resulting in easily calculable addresses for the elements stored and this allows faster access to an element at a specific index.Data storage scheme of an arrayLinked List: Linked lists are less rigid in their storage structure and element 2 min read Types of Linked ListTypes of Linked ListA linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers. In simple words, a linked list consists of nodes where each node contains a data field and a reference(link) to the next node in the 15+ min read Singly Linked List TutorialA singly linked list is a fundamental data structure, it consists of nodes where each node contains a data field and a reference to the next node in the linked list. The next of the last node is null, indicating the end of the list. Linked Lists support efficient insertion and deletion operations.Un 8 min read Doubly Linked List TutorialA doubly linked list is a more complex data structure than a singly linked list, but it offers several advantages. The main advantage of a doubly linked list is that it allows for efficient traversal of the list in both directions. This is because each node in the list contains a pointer to the prev 8 min read Introduction to Circular Linked ListA circular linked list is a data structure where the last node connects back to the first, forming a loop. This structure allows for continuous traversal without any interruptions. Circular linked lists are especially helpful for tasks like scheduling and managing playlists, allowing for smooth navi 15+ min read Basic Operations on Linked ListInsertion in Linked ListInsertion in a linked list involves adding a new node at a specified position in the list. There are several types of insertion based on the position where the new node is to be added:At the front of the linked list Before a given node.After a given node.At a specific position.At the end of the link 4 min read Search an element in a Linked List (Iterative and Recursive)Given a linked list and a key, the task is to check if key is present in the linked list or not. Examples:Input: 14 -> 21 -> 11 -> 30 -> 10, key = 14Output: YesExplanation: 14 is present in the linked list.Input: 6 -> 21 -> 17 -> 30 -> 10 -> 8, key = 13Output: NoExplanatio 12 min read Find Length of a Linked List (Iterative and Recursive)Given a Singly Linked List, the task is to find the Length of the Linked List.Examples:Input: LinkedList = 1->3->1->2->1Output: 5Explanation: The linked list has 5 nodes.Input: LinkedList = 2->4->1->9->5->3->6Output: 7 Explanation: The linked list has 7 nodes.Input: Lin 11 min read Reverse a Linked ListGiven a linked list, the task is to reverse the linked list by changing the links between nodes.Examples: Input: head: 1 -> 2 -> 3 -> 4 -> NULLOutput: head: 4 -> 3 -> 2 -> 1 -> NULLExplanation: Reversed Linked List: Input: head: 1 -> 2 -> 3 -> 4 -> 5 -> NULLOut 15+ min read Deletion in Linked ListDeleting a node in a Linked List is an important operation and can be done in three main ways: removing the first node, removing a node in the middle, or removing the last node.In this article, we will explore deletion operation on Linked List for all the above scenarios. Types of Deletion in Linked 3 min read Delete a Linked List node at a given positionGiven a singly linked list and a position (1-based indexing), the task is to delete a linked list node at the given position.Note: Position will be valid (i.e, 1 <= position <= linked list length)Example: Input: position = 2, Linked List = 8->2->3->1->7Output: Linked List = 8->3 8 min read Write a function to delete a Linked ListGiven a linked list, the task is to delete the linked list completely.Examples:Input: head: 1 -> 2 -> 3 -> 4 -> 5 -> NULLOutput: NULLExplanation: Linked List is Deleted.Input: head: 1 -> 12 -> 1 -> 4 -> 1 -> NULLOutput: NULLExplanation: Linked List is Deleted.Table of C 9 min read Write a function to get Nth node in a Linked ListGiven a LinkedList and an index (1-based). The task is to find the data value stored in the node at that kth position. If no such node exists whose index is k then return -1.Example: Input: 1->10->30->14, index = 2Output: 10Explanation: The node value at index 2 is 10 Input: 1->32->12 11 min read Program for Nth node from the end of a Linked ListGiven a Linked List of M nodes and a number N, find the value at the Nth node from the end of the Linked List. If there is no Nth node from the end, print -1.Examples:Input: 1 -> 2 -> 3 -> 4, N = 3Output: 2Explanation: Node 2 is the third node from the end of the linked list.Input: 35 -> 14 min read Top 50 Problems on Linked List Data Structure asked in SDE Interviews A Linked List is a linear data structure that looks like a chain of nodes, where each node is a different element. Unlike Arrays, Linked List elements are not stored at a contiguous location. Here is the collection of the Top 50 list of frequently asked interview questions on Linked Lists. Problems 3 min read Like