Q) Given Singly linked list (1->2->3->4->5->6) , convert this list to (1->6->2->5->3->4). 1st's element next is nth element, 2nd's next is n-1th element and so on.
--> I gave them one solution that uses stack, but no more extra space is expected, panel was very friendly and helpful they gave me time to time hint and finally I came up with below solution.
Solution:
1) Split linked list into 2 halfs
2) Reverse the 2nd half.
3) Now merge 1st and 2nd half again.
Q) Internal implementation of Malloc function
Q) Move all the 10s at the end of the array, in O(N)
Q) Some basic questions on Hashmap, vectors, set,list
Q) Some question on OOPS, virtual functions, copy constructor, why & is used in definition of Copy Const etc.
PS: I just added this review to admire the panel, they were very kind & friendly, supportive, and give you hints to arrive at the solution.
