## Remove all multiples of K from Binary Tree

Given a binary tree and an integer K, the task is to remove all the nodes which are multiples of K from the given binary… Read More »

- Difference between Singly linked list and Doubly linked list
- Convert Singly Linked List to XOR Linked List
- Number of connected components in a doubly linked list
- Count triplets in a sorted doubly linked list whose product is equal to a given value x
- Product of all prime nodes in a Doubly Linked List
- Product of all nodes in a doubly linked list divisible by a given number K
- Find count of common nodes in two Doubly Linked Lists
- Remove all multiples of K from Binary Tree
- Find pairs with given product in a sorted Doubly Linked List

Given a binary tree and an integer K, the task is to remove all the nodes which are multiples of K from the given binary… Read More »

Prerequisite: XOR Linked List – A Memory Efficient Doubly Linked List | Set 1 XOR Linked List – A Memory Efficient Doubly Linked List |… Read More »

Introduction to Singly linked list : A singly linked list is a set of nodes where each node has two fields ‘data’ and ‘link’. The… Read More »

Given a doubly linked list ‘L’ and an array ‘refArr’ of references to the nodes of the doubly linked list ‘L’. Array 'refArr' does not… Read More »

Given a sorted doubly linked list of distinct nodes(no two nodes have the same data) and a value x. The task is to count the… Read More »

Given a doubly linked list containing N nodes. The task is to find the product of all prime nodes. Example: Input: List = 15 <=>… Read More »

Given two doubly linked lists. The task is to find the total number of common nodes in both the doubly linked list. Examples: Input :… Read More »

Given a sorted doubly linked list of positive distinct elements, the task is to find pairs in the doubly linked list whose product is equal… Read More »

Given a doubly linked list containing N nodes and given a number K. The task is to find the product of all such nodes which… Read More »

Design a data structure for LRU Cache. It should support the following operations: get and set. get(key) – Get the value (will always be positive)… Read More »

Given a doubly linked list containing N nodes, the task is to delete all nodes from the list which are divisible by K. Examples: Input:… Read More »

Given a doubly linked list containing N nodes, the task is to delete all nodes from the list which are prime. Examples: Input: List =… Read More »

Given a doubly linked list of positive integers. The task is to print the given doubly linked list data in reverse order. Examples: Input: List… Read More »

Given a doubly linked list and an array with only odd values. Both are of equal size N. The task is replace all node which… Read More »

Given a doubly linked list containing N nodes, the task is to delete all the even nodes from the list. Examples: Input: Initial List =… Read More »