Skip to content

Category Archives: Linked List

Given a singly linked list, the task is to replace every node with its closest bell number. Bell numbers are a sequence of numbers that… Read More
Given a linked list and a key to be deleted. The task is to delete the first occurrence of the given key from the linked… Read More
Given a singly linked list, the task is to replace every node with its closest Catalan number. Note: Catalan numbers are defined as mathematical sequence… Read More
Given a singly linked list of integers, the task is to replace every node with its closest Tribonacci number and return the modified linked list.… Read More
Given a linked list of integers, the task is to determine if there exists a subsequence of prime numbers whose sum is a perfect square.… Read More
Given a linked list with weights, the task is to find the product of nodes whose weights are all triangular numbers where a triangular number… Read More
Given two linked lists head1 and head2, the task is to remove all occurrences of head2 in head1 and return the head1. Examples: Input: head1… Read More
Given a singly linked list with weights, the task is to find the product of nodes with minimum and maximum weights in the list. Examples:… Read More
Given a singly linked list, the task is to replace every node with its closest triangular number. Examples: Input: 3 -> 9 -> 21 ->… Read More
Given a linked list, the task is to find the maximum sum of a sublist with composite number nodes. A composite number is any positive… Read More
Doubly linked list is a data structure that has reference to both the previous and next nodes in the list. It provides simplicity to traverse,… Read More
Given a Singly linked list of integers, the task is to count the number of pairs of nodes whose bitwise AND is a prime number.… Read More
INTRODUCTION:- A linked list is a data structure that consists of a sequence of elements called nodes. Each node in the linked list contains a… Read More
Given a singly linked list of integers, the task is to replace every node with its closest Fibonacci number and return the modified linked list.… Read More
Given a Linked list, the task is to check if the most frequently occurring element in the linked list is divisible by the smallest element… Read More