## Count pairs from two linked lists whose product is equal to a given value

Given two linked lists(can be sorted or unsorted) of size n1 and n2 of distinct elements. Given a value X. The problem is to count… Read More »

Given two linked lists(can be sorted or unsorted) of size n1 and n2 of distinct elements. Given a value X. The problem is to count… Read More »

Given an unsorted Linked List of integers. The task is to sort the Linked List into a wave like Line. A Linked List is said… Read More »

Given a singly linked list. The task is to find the sum of nodes of the given linked list. Task is to do A +… Read More »

Given a linked list, the task is to rearrange the linked list in the following manner: Reverse the second half of given linked list. Rearrange… Read More »

Given a doubly linked list containing N nodes and a number X, the task is to delete all the nodes from the list that are… Read More »

Consider the following function to traverse a linked list. filter_none edit close play_arrow link brightness_4 code void traverse(struct Node *head) { while (head->next != NULL)… Read More »

You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of… Read More »

Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we… Read More »

Is it possible to create a doubly linked list using only one pointer with every node. (A) Not Possible (B) Yes, possible by storing XOR… Read More »

What are the time complexities of finding 8th element from beginning and 8th element from end in a singly linked list? Let n be the… Read More »

A circularly linked list is used to represent a Queue. A single variable p is used to access the Queue. To which node should p… Read More »

Consider the function f defined below. filter_none edit close play_arrow link brightness_4 code struct item { int data; struct item * next; }; int… Read More »

Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among union, intersection, membership, cardinality will be… Read More »

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is (GATE CS… Read More »

The following C function takes a single-linked list of integers as a parameter and rearranges the elements of the list. The function is called with… Read More »