Given a linked list, check if linked list is palindrome or not.
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.
Given a linked list and two positive integers M and N, delete every N nodes in it after skipping M nodes.
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.
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.
Given a linked list and a positive integer K, find K’th node from the end in a linked list.
Given a linked list, reverse every adjacent group of k nodes in it where k is given positive integer.
In this post, we will see how to reverse linked list using recursion in C and C++.
In this post, we will see how to reverse linked list iteratively without using recursion.
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.
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 …
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.