## Insertion in a sorted circular linked list when a random pointer is given

Given an array arr[] of integers and a pointer to a random node of a circular sorted linked list (initially empty), the task is to… Read More »

Given an array arr[] of integers and a pointer to a random node of a circular sorted linked list (initially empty), the task is to… Read More »

Given a circular linked list with N nodes and an integer K where 0 < K < N, the task is to split the first… Read More »

Given a Binary Tree, convert it to a Circular Doubly Linked List. The left and right pointers in nodes are to be used as previous… Read More »

Given a singly circular linked list. The task is to find the sum and product of nodes which are divisible by K of the given… Read More »

Delete all odd position nodes from circular linked list Given a Singly Circular Linked List, starting from the first node delete all odd position nodes… Read More »

Given a Circular Linked List. The task is to write programs to delete nodes from this list present at: First position. Last Position. At any… Read More »

Given a singly circular linked list of nodes. The task is to find the smallest and largest elements in the circular linked list. Examples: Input… Read More »

Given a circular singly linked list containing N nodes. The task is to delete all nodes from the list which are prime. Examples: Input :… Read More »

Given a circular singly linked list containing N nodes, the task is to delete all the even nodes from the list. Examples: Input : 57->11->2->56->12->61… Read More »

Given a singly Circular linked list. The task is to find the sum of nodes of the given linked list. For the above circular list,… Read More »

Delete every kth Node from a circular linked list until only one node is left. Also print the intermediate lists. Examples: Input : n=4, k=2,… Read More »

Pre-requisite: Convert an Array to a Circular Doubly Linked List, Doubly Circular Linked List Given a Doubly circular linked list. The task is to find… Read More »

The entire process consisted of 5 rounds: 1 online coding, 1 debugging, 2 Technical and 1 HR/System Design Round. The minimum criteria for the online… Read More »

Prerequisite: Insert Element Circular Doubly Linked List. Convert an Array to a Circular Doubly Linked List. Given the start pointer pointing to the start of… Read More »

The problem is to reverse the given doubly circular linked list. Examples: Input: Output: Recommended: Please try your approach on {IDE} first, before moving on… Read More »