Find start node of the cycle in a linked list
Given a linked list containing a cycle, return the starting node of the cycle without modifying the list. Report if there are no cycles in the linked list.
Category: Linked List
Remove all nodes from a linked list that matches a given key
Given a linked list, remove all nodes from it that match a given key.
Construct a complete binary tree from its linked list representation
Given a linked list, construct a complete binary tree from it. Assume that the order of elements present in the linked list is the same as that in the complete tree’s array representation.
In-place merge two height-balanced BSTs
Given two height-balanced binary search trees, in-place merge them into a single balanced binary search tree. For each node of a height-balanced tree, the difference between its left and right subtree height is at most 1.
Remove loop from a linked list
Given a linked list containing a loop, remove the loop from it.
Check whether the leaf traversal of given binary trees is the same or not
Given two binary trees, check whether the leaf traversals of both trees are the same or not.
Extract leaves of a binary tree into a doubly-linked list
Given a binary tree, extract all its leaves into a doubly-linked list, i.e., remove all leaf nodes from the binary tree and construct a doubly linked list out of them.
Find the intersection point of two linked lists
Given two linked lists, where the tail of the second list points to a node in the first list, find the node where both lists intersect.
Reverse specific portion of a linked list
Write an efficient algorithm to reverse the specified portion of a given linked list.
Update random pointer for each linked list node to point to the maximum node
Given a linked list with each node having an additional random pointer that points to any random node of the linked list or null, update the random pointer in each linked list node to point to a node with maximum value to their right.
Clone a linked list with random pointer
Write an efficient code to clone a linked list with each node containing an additional random pointer. The random pointer can point to any random node of the linked list or null.
Convert a Binary Search Tree into a Min Heap
Given a binary search tree (BST), efficiently convert it into a min-heap. In order words, convert a binary search tree into a complete binary tree where each node has a higher value than its parent’s value.