1.In array find no of pair which make sum equal to k without using extra space.(simple) Sorted the array apply 2 pointer one from front(smallest element) one from back(largest element) 2.Simple dp problem given an array containing +ve number we have to go from first element to last element in mim step we can make atmost jump of arr[i] from index i i.e if we are @ index 2 and value @ arr[2] is 4 the we can go to arr[3],arr[4]......arr[6] (Hint-simple question do what it say ) 3.Insert node in BST 4.What is pointer? 5.what is Copy constructor it's use? 6.Explain OOPS concepts? 7.Question on Table Join and relations? 8.OSI layer question question on data compression in presentation layer? . I answered all the question and All the interviewer were happy with me. Then there was Tech+managerial round I was the only one left among all the other who came from my college(in slot 2 ) a senior guy came he asked me why product based company is better then service based, were do you jabong after 5 year, what are the challenges in IT industry, how to you spend your day, how is jabong doing ? He had bunch of silly question to ask I gave him the answer with best of my knowledge but we was ignoring all my answer and was cracking lame joke on me because I was from non-cs,it branch he had mindset of reject me from starting of interview. Then there was normal HR round about family background etc etc which went well I answered all the question and the HR guy was happy with me. On next day they gave the result to TnP of my college- 3 student were in wait list 2 from slot 1 1(me) from slot 2 They rejected me and and gave the offer to both of the slot 1 guys as they were from CS and IT branch.
