Coding test 1) Merge k sorted lists and store it in 1st list. Do not use any other extra space. 2) Given a paragraph and a group of strings. find the smallest interval in the paragraph such that it has all the strings in the group. 3) Given some array of strings. divide it into groups of anagrams. 1st interview 1) Given a tree print the corner elements of each level in a zigzag manner. 2) In an array print all the triplets such that a^2 + b^2=c^2. There can be negative numbers also. 2nd Interview 1) Populate next right pointer of a tree. 2) Consider an infinite stream of numbers. At any point print smallest k elements. 3) Given a set of N nuts of different sizes and N bolts of different sizes. There is a one-one mapping between nuts and bolts. Match nuts and bolts efficiently. Comparing of a nut to another nut is not possible. Nuts can be compared with bolts only.