Interview Experience 29

##First Round

• 0-1 knapsack problem
• Find the minimum no. of swaps required in an unsorted array to make it sorted
• Create a circular doubly linked list, such that elements in it are always in sorted order, and write insert( int data ) and delete( node* nd ) and print( int pos ) functions, where pos signifies the position from head, from which to start printing the list.

##Second Round

Some puzzles, and normal algorithmic and DS questions

##Third Round .................. Algorithmic questions + DS, OOPS concepts, and some basic linux commands

##Fourth Round .................... Questions from resume, what I'm interested in, why Grey Orange, and stuff like that.