Check if a Linked List is Palindrome or not
Given a linked list, check if linked list is palindrome or not.
Rearrange linked list in specific manner in linear time
Given a linked list, rearrange linked list nodes in specific way in linear time and constant space. The alternate positions in the output list should be filled with the nodes starting from the beginning and from the very end of the original list respectively.
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 in it 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 together into one list which is in decreasing order and return 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 together into first list by taking nodes alternately between the two lists. If first list runs out, remaining nodes of second list should not be moved.
Find K’th node from the end in a linked list
Given a linked list and a positive integer K, find K’th node from the end in a linked list.
Reverse every group of k nodes in given linked list
Given a linked list, reverse every adjacent group of k nodes in it where k is given positive integer.
Reverse a Linked List in C/C++ using Recursion
In this post, we will see how to reverse linked list using recursion in C and C++.
Reverse a linked List in C and Java (Iterative Solution)
In this post, we will see how to reverse linked list iteratively without using recursion.
Intersection of two given sorted linked lists
Given two lists sorted in increasing order, create and return a new list representing the intersection of the two lists. The new list should be made with its own memory — the original lists should not be changed.
Merge Sort Algorithm for Singly Linked List (in C and Java)
Given a linked list, sort it using merge sort algorithm. Merge sort algorithm is an efficient, general-purpose sorting algorithm which produces a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Merge sort is a comparison sort, i.e. it can sort items of any …
Merge two sorted linked lists into one
Write a function that takes two lists, each of which is sorted in increasing order, and merges the two together into one list which is in increasing order and return it.