Linked List: Given a binary tree, convert into circular doubly linked list
Problem Statement: You are given a binary tree, you need to convert it into DLL. Left and right pointers are used as previous and next…
Linked List: Given 2 linked list by choosing max element at each position
Problem Statement: You are given 2 LL of equal size. You need to create new linked list by taking max of the 2 elements from both the linked…
Linked List: Copy a linked list with given next and random pointer
Problem Statement: You are given a linked list. Each node will have 2 links, next pointer pointing to the next node and a random pointer,…
Linked List: Split a circular linked list into two halves
Problem Statement: Split a circular linked list into two halves If there are odd number of nodes, then first node should have one more than…
Linked List: Sort a nearly sorted doubly linked list
Problem Statement: You are given a DLL with n nodes. Each node is at-most “k” indices away from its target position. You need to…
Linked List: Perform the below delete operations on a Doubly Linked List
1. Delete a Doubly Linked List node at a given position 2. Delete all occurrences of a given key in a doubly linked list 1. Delete a Doubly…
Linked List: Check if a doubly linked list of characters is palindrome or not
Solution: Step 1: Take two pointers, “right_pointer” will point to the end of the list, “left_pointer” will point to the beginning of the…
Linked List: Perform bubble sort on Double linked list
Problem Statement: You are given a double linked list, you need to perform bubble sort on it. Example: Input : head:…
Linked List: Given a linked list convert into peak list
Problem Statement: You are given a LL with unique values, you need to convert into peak list. A LL is called as peak list, where in all the…
Linked List: Perform below operations from a circular linked list
1. Delete at beginning 2. Delete at specific position 3. Delete at end 1. Delete at beginning To delete the first node, we check if the list…