Rearrange linked list in a specific manner
Given a linked list, split it into two lists where each list contains alternating elements from the original list and then finally join them back together.
Category: Linked List
Move the last node to the front of a linked list
Given a linked list, move its last node to the front. For example, list {1, 2, 3, 4} should be changed to {4, 1, 2, 3}.
Check if a linked list is palindrome or not
Given a linked list, check if it is a palindrome or not.
Rearrange linked list in a specific manner in linear time
Given a linked list, rearrange linked list nodes in a specific way in linear time and constant space. The alternate positions in the output list should be filled with nodes starting from the beginning and end of the original list.
Delete every `N` nodes in a linked list after skipping `M` nodes
Given a linked list and two positive integers, m and n, delete every n nodes after skipping m nodes.
Merge two sorted linked lists from their end
Write a function that takes two lists, each of which is sorted in increasing order, and merges the two into one list, which is in decreasing order, and returns it. In other words, merge two sorted linked lists from their end.
Merge alternate nodes of two linked lists into the first list
Given two linked lists, merge their nodes into the first list by taking nodes alternately between the two lists. If the first list runs out, the remaining nodes of the second list should not be moved.
Find k’th node from the end of a linked list
Given a linked list and a positive integer k, find the k’th node from the end of the list.
Reverse every group of `k` nodes in a linked list
Given a linked list, reverse every adjacent group of k nodes where k is a given positive integer.
Reverse a Linked List – Recursive Solution | C, C++, Java, and Python
This post will reverse the linked list using recursion in C, C++, Java, and Python.
Reverse a linked List – Iterative Solution | C, Java, and Python
In this post, we will see how to reverse the linked list iteratively without using recursion.
Intersection of two sorted linked lists
Given two lists sorted in increasing order, create and return a new list representing the two lists’ intersection. The new list should be made with its memory – the original lists should not be changed.