Easy | Implementation of Deque using Doubly Linked List | Problem Statement The problem “Implementation of Deque using Doubly Linked List” states read more |

Medium | Linked List Cycle | Problem Statement “Linked List Cycle” problem states that you are given a linked list. read more |

Swap Nodes In Pairs | In swap nodes in pairs problem, we have given a linked list consisting of n nodes. Swap every node read more | |

Merge K Sorted Linked Lists | Merge K sorted linked lists problem is so famous as per the interview point of view. This question read more | |

Merge Two Sorted Linked Lists | In merge two sorted linked lists we have given head pointer of two linked lists, merge them such read more | |

Merge Two Sorted Lists Leetcode | What is merge two sorted lists problem on leetcode? This is so interesting question asked so many read more | |

Reverse Nodes in K-Group | Problem In Reverse Nodes in K-Group problem we have given a linked list, Reverse the linked list in read more | |

Add two numbers | Add two numbers is a problem in which we have given two non-empty linked list representing a read more | |

Insert Node in the Sorted Linked List | Insert a new node in the sorted linked list in sorted way After inserting a node in sorted linked read more | |

Detect a loop in the Linked List | In the given linked list, find whether there is loop or not If there is a loop in the linked list read more | |

Find Nth Node | In the given linked list find nth node. The function should return the data value in the nth node. read more | |

Swap kth node from beginning with kth node from end | In the given linked list, swap kth node from beginning with kth node from the end. We should not read more | |

Swap nodes in the linked list | We are given a linked list and two key values, we need to swap these nodes. Example Time complexity read more | |

Delete last occurrence | In the given linked list, write a function to delete the last occurrence of a given key from the read more | |

Check if a linked list of strings form a palindrome | Given a linked list handling string data, write a function to check whether the data forms a read more | |

Merge two sorted linked lists such that merged list is in reverse order | Given two linked lists sorted in reverse order, write a function to merge them in such a way that read more | |

Rearrange a given linked list in-place | Given a singly linked list L0-> L1-> … -> Ln-1-> Ln. Rearrange the nodes in the list read more | |

Clone a Linked List with next and random pointer | Given a doubly linked list, in which one pointer is pointing to the next node just like in a singly read more | |

Construct a Maximum Sum Linked List out of two Sorted Linked Lists having some Common nodes | Given two sorted linked lists, construct a list that contains maximum sum path from start to end. read more | |

Quick Sort on SIngly Linked List | Given a linked list, we will sort the linked list using quick sort. Example Linked List before read more | |

Flatten a multilevel linked list | Given a linked list where in addition to next pointer each node has a child pointer, which may or read more | |

Rotate a Linked List | Given a linkedlist and an integer k, write a function to rotate the linked list counter clockwise read more | |

Union and Intersection of Two Linked Lists | Given two linked lists, find the union and intersection of the elements in two linked lists. read more | |

Sort linked which is sorted on absolute values | Write a function to sort a given linked list which is already sorted based on absolute values. read more | |

Binary Tree to Doubly linked list | Convert the given Binary Tree into a Doubly linked list in-place. The order of nodes should be same read more | |

Rearrange a linked list in Zig-Zag | Rearrange a given linked list such that it should be in form a < b > c < d > e < f read more | |

Clone a linked list with next and random pointer (Hashing) | Given linked list each nodes contains : 1. Node data 2. Pointer to next node. 3. Pointer (arbitrary read more | |

Flattening a linked list | In the given linked list, every node has two pointers : 1. Pointer to next node (Main linked read more | |

Segregate even and odd nodes in a linked list | For the given input linked list, write a function to segregate all even and all odd such that all read more | |

Delete a node of a linked list at given position | For the given linked list write a function to delete a node at the given position. Example Time read more | |

Compare two strings(linked lists) | In the given two linked lists where each node of the list is character. We need to write a function read more | |

Merge sort better than quick sort for linked lists | Why “Merge Sort” better for linked lists ? And Why “Quick Sort” better for array ? Why read more | |

Sort a linked list that is sorted alternating ascending and descending | In the given linked list, the list is in alternating ascending and descending orders. We need to read more | |

Remove middle points in a linked list of line segments | In the given linked list each node consists of co-ordinates (pair of data). These co-ordinates are read more | |

Can we reverse a linked list in less than O(n) time ? | Can we write an algorithm to reverse the given linked list in less than O(n) runtime ? No, we read more | |

Merge a linked list into another at alternate positions | Given two linked lists A and B, we need to insert nodes of B into A at alternative positions of read more | |

Delete N nodes after M | In the given linked list delete N nodes after M nodes, do this till the end of the linked list. read more | |

Sort a linked list with 0s, 1s and 2s | In the given linked list, which contains only 0s, 1s or 2s. Write a function to sort the linked read more | |

Triplet from three linked lists with given sum | In the given three linked lists, find one node from each of the three lists such that there sum is read more | |

Delete a node under given conditions | In the given linked list write a function to delete a given node. Under conditions : a) Parameter read more | |

Reverse a Linked List in groups | In the given linked list, write a function to reverse every set of k nodes. (K is input value) read more | |

Reverse a singly linked list recursively | Reverse the given singly linked list recursively Example Algorithm Step 1 : create a function that read more | |

Reverse a Singly Linked List (Iterative/Non-Recursive) | Given a linked list, write a program to reverse all the elements in the linked list and display the read more | |

Remove all duplicates in an unsorted linked list | Given an unsorted linked list, write a program to remove all the duplicate elements in the unsorted read more | |

Remove all duplicates in a sorted linked list | Given a sorted linked list. We have to remove all the duplicates that are present in the sorted read more | |

Check if the linked list is palindrome | Given a singly linked list, find whether it’s a palindrome are not Palindrome : an integer or a read more | |

Find the occurrences of a number in a linked list | Find the number of occurrences of a number in the given linked list Occurrences : number of times x read more | |

Find nth node of the Linked list from the end | Given a linked list, write a program for finding the nth element from the end of the linked list read more | |

Find middle of the Linked List | Given a Linked List, write a program to find middle of the linked list Example Input : read more | |

Insert nodes in a linked list in a sorted way (Ascending Order) | In this algorithm, we will insert elements in the linkedlist in a sorted way ie, data values from read more | |

Check if two linked lists are identical | Find whether the given two linked lists are identical or not To check whether two linked lists are read more | |

Move last element of the Linked List at first place | In the given linked list write a program to move last element to front of the linked list Example read more | |

Delete a node in doubly linked list | In the given doubly linked list, delete a node We can delete head node, middle node or last node. read more | |

How to Delete a Linked List | Given a linked list, write a program to delete the linked list completely. That is we will be read more | |

Split linked list using alternate nodes | Given a linked list, you need to split it into two linked lists with alternate elements in each of read more | |

Create a Doubly Linked List | Write a program to Create a doubly linked list A double linked list contains an extra pointer to read more |