## Recursive insertion and traversal linked list

We have discussed different methods of linked list insertion. How to recursively create a linked list? Recursively inserting at the end: To create a Linked… Read More »

- Real-time application of Data Structures
- How Coronavirus outbreak can end | Visualize using Data structures
- Construct a Doubly linked linked list from 2D Matrix
- Flattening a linked list | Set 2
- Operator Overloading '<<' and '>>' operator in a linked list class
- Find the string formed by joining k consecutive nodes of linked list
- Sum of all Palindrome Numbers present in a Linked list
- Detect Cycle in a Linked List using Map
- Find length of loop in a Linked List using Map
- Remove all Fibonacci Nodes from a Circular Singly Linked List
- Check if Inorder traversal of a Binary Tree is palindrome or not
- Swap Kth node from beginning with Kth node from end in a Doubly Linked List
- Find the largest and second largest value in a Linked List
- Merge two unsorted linked lists to get a sorted list
- Find the element in a linked list with frequency at least N/3
- Sum of all subset sums of a linked list
- Static and Dynamic data structures in Java with Examples
- Remove all even parity nodes from a Doubly and Circular Singly Linked List
- Program to delete all even nodes from a Singly Linked List
- Program to remove vowels from Linked List
- Doubly Linked List Tutorial
- Remove all the Even Digit Sum Nodes from a Circular Singly Linked List
- Next greater element in the Linked List
- Remove all nodes from a Doubly Linked List containing Fibonacci numbers
- Find last 2 survivors in N persons standing in a circle after killing next to immediate neighbour
- Remove the common nodes in two Singly Linked Lists
- Sum and Product of nodes with value as even digit sum in Circular Linked List
- Sum and Product of all even digit sum Nodes of a Singly Linked List
- Delete continuous nodes with sum K from a given linked list
- First Fit algorithm in Memory Management using Linked List

We have discussed different methods of linked list insertion. How to recursively create a linked list? Recursively inserting at the end: To create a Linked… Read More »

Given a Circular linked list exchange the first and the last node. The task should be done with only one extra node, you can not… Read More »

Given a singly linked list delete node at k-th position without using loop. Examples: Input : list = 9->8->3->5->2->1 k = 4 Output : 9->8->3->2->1… Read More »

Given a circular linked list of size n. The problem is to reverse the given circular linked list by changing links between the nodes. Examples:… Read More »

We are given a linked list and positions m and n. We need to reverse the linked list from position m to n. Examples: Input… Read More »

Given a singly linked list and we want to count the elements that are continuously increasing and print the increasing linked list. Examples: Input :… Read More »

Given a linked list that contains some random integers from 1 to n with many duplicates. Replace each duplicate element that is present in the… Read More »

Given a singly linked list of n nodes and find the smallest and largest elements in linked list. Examples: Input : 15 14 13 22… Read More »

Reverse a Stack without using recursion and extra space. Even the functional Stack is not allowed. Examples: Input : 1->2->3->4 Output : 4->3->2->1 Input :… Read More »

Given a singly linked list, find middle of the linked list and set middle node of the linked list at beginning of the linked list.… Read More »

Given a linked list of n nodes which is first sorted, then rotated by k elements. Find the value of k. Recommended: Please try your… Read More »

Given a singly linked list, we have to convert it into circular linked list. For example, we have been given a singly linked list with… Read More »

Given a Linked List of length n and block length k rotate in circular manner towards right/left each block by a number d. If d… Read More »

There are n people standing in a circle waiting to be executed. The counting out begins at some point in the circle and proceeds around… Read More »

Insert a node x after the nth node from the end in the given singly linked list. It is guaranteed that the list contains the… Read More »