Team : Bing

The questions where trciky yet technical.

Interviewer helped alot by giving hints occassionally though.



#Given an array A[n] such that A[i+1] = A[i]+1 OR A[i]-1, and a number k, find out whether k is present in A[n] or not, in most efficient way?



#Name any 1 microsoft product that you have been using and suggest 5 improvements in it alongwith priority assignments p1....p5.



#A square picture is cut into 16 squares and they are shuffled. Write a program to rearrange the 16 squares to get the original big square.



#There are 9 identical Marbels out of which 1 is heavy. find out that Marbel.



#given 3 sorted arrays, array a, b, c.

find all pairs where a[i] + b[j] = c[k]

note : a, b , c are sorted arrays.



#What is the difference between the two declarations?



int p=*(int*)i;

int p=*(int*)&i;



#Given an unsorted array of size 5.

How many minimum comparisons are needed to find the median? then he extended it for size n.



#Given an array which is alternatively sorted. What will be the time complexity to find out an element in it.

e.g. 14,3,16,6,22,7,24,11,27



best of Luck!!!

HAVE YOUR SAY...