2> u are given array of struct struct data{ int parentValue; int childValue}; and you have to create

binary tree out of it .. 1> Given an array arr[] of n integers, construct a Product Array prod[] (of same si ze) such that prod[i] is equal to the product of all the elements of arr[] excep t arr[i]. Solve it without division operator and in O(n). Example: arr[] = {10, 3, 5, 6, 2} prod[] = {180, 600, 360, 300, 900}

*************************************************************** Interview Details First, they conducted a written test, which has 2 question (Al gorithm + coding). On the basis of which they shortlisted people for interview. Then there was two tech. interview. which was pretty tough. And then there was o ne general HR interview. Guys were really cool. With every question, we are supp ose to mention the time and space complexity of the algorithm. Interview Question They just focused on Algorithmic and Coding Skills. **************************************************************************