1)Given a Sorted array find two elements whose sum is n (First I said in O(n^2) Interviewer said to Optimize the Algo I Optimized to n log(n) ) I took 5 mins to think of Optimizing :( 2)Find weather a Linked List is Malfunctioned or Not i.e any any loops If there is loop how will you find the Point where the Loop had been Started I were Not able to Answer the 2nd part precisely 3)puzzle:- there are 3 Baskets closed baskets and with one Basket only Apples , second one only Oranges and third one both Apple and Oranges and You have Labels A,O,AO all the Labels are not matched to respective Basket and you can check only one fruit in any of the Basket and Place All Labels Correctly.(I answered this one too).