Interview Experience 2 (Intern)

##Round 1:

Find a given element in the rotated array. You are given an input N.You have N number of pairs of opening and closing brackets.You need to print all the valid combinations of the brackets.

##Round 2:

Given a directed cyclic graph and a destination vertex.You have to print all the nodes from which you can reach to the destination vertex. Prove the complexity of DFS (for both Adjacency Matrix and Adjacency List method). Given a binary tree.You need to print all the boundary elements in anticlockwise manner.