GeeksforGeeks

Delete the node from link list,You have the pointer of that node only?

How would you print a linked list in reverse order, you r not allowed to change the list

given a binary tree, convert it to doubly linked list. if you are going for a company interview, then read the solution before interview.

There is a linked list of numbers of length N. N is very large and you don’t know N. You have to write a function that returns k random numbers from the list. Numbers should be completely random.

compare linked list and arrays

They asked to write a program to merge two sorted lists..

Two singly linked, sorted (by ascending order) lists l1, l2. Write a recursive function that returns the intersection of these two lists. For the resulting list you have to use elements of the two lists only and no extra memory. All extra nodes should be deleted using "free()".

typedef struct node
{
int data;
struct node* next;
}

Function should be:

node* SortedIntersection(node* l1, node* l2)

remove duplicates from and unsorted list, optimize it.

reverse a linked list, with and without recursion.

You are given two unsorted linked lists, get their union.
Eg. a) 1->9->9->5->7->8->9->7
b) 44->33->1->9->55

Result:
1->9->5->7->8->44->33->55
The elements in the result can be in any order
1

Write a function that would: return the 5th element from the end in a singly linked list of integers, in one pass, and then provide a set of test cases against that function

Convert a doubly linked list to a binary search tree in place.

Given a pointer to a node in a singly linked list, how do you delete the node?

Program to tell if a singly linked list is circular.

Write a program for deleting a node in Doubly Linked list.

Given a linked list with 'n' numbers and a number X, find numbers in the list that add up to the value of the given number X.
Input Linked List = {6,4,2,5,9,3,1,5,7,8,2}
X = 6
Output = {4,2} or {5,1} or {3,1,2}

count number of nodes in a singly LinkedList which contains a loop.