Prompt: Given a linked list, reorder the linked list such that the first half of the linked list are the odd nodes and the last half are the even nodes.
[Read More]
Prompt: You are given a linked list with length n. Each node has a val, a pointer to the next node, and a pointer to a random node in the list or None. Return a deep copy of this linked list.
[Read More]
Prompt: Given two lists of integers, one is the preorder traversal of a binary tree and the other is the inorder traversal of the same tree. The goal is to reconstruct the binary tree and return the root node.
[Read More]
Prompt: Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.
[Read More]