ProDeveloperTutorial

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…

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…

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,…

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…

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…

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…

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…

Problem Statement: You are given a double linked list, you need to perform bubble sort on it. Example: Input : head:…

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…

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…