1st round: 1.Delete a node from the linked list. Only pointer to that node is given. Head is not given. 2. Find the common minimum elemnet in 2 sorted arrays. If not found, return -1. 2nd round: 1. Count the number of rotation in a (left) rotated sorted array 2. Find the first non-repeating character from the stream of characters.