A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null.Construct a deep copy of the list. 138. Copy List with Random Pointer leetcode
Given a non-empty, singly linked list with head node head, return a middle node of linked list. LinkedList - 876. Middle of the Linked List leetcode