There were 3 rounds... First round there were some puzzles 1. You have 8 balls and a weighing scale. You have 2 chances to find the lighttest ball. A. divide the balls in in 3 groups of 3, 3 and 2. 2. 4 people have to cross a river and they take 1,2,5,10 mins respectively. At any time 2 people have to cross the river and one of them has to come back. Need to take everyone in 17 mins A. 1,2 go first... 2 comes back, 5 and 10 go together.... then 1 goes back and gets 2.. total 17 mins 3. Noughts and Crosses game ( 0 and X). You have to write a program which will take a 2 dim array and tell whether the game is over or not. 4. Write a program to merge 2 sorted arrays into a merged array. Use merge sort here. 5. Write a program to display a pyramid 1 32 654 10987 6. One of weirdest question of all time. How would you create an array of List object in dot net. And how would you add items to it. A. I am sorry but i really dont understand why you would ever create an array of list object. Not sure what the purpose of the question was. But technically you can create an array. 7. Normal theory questions about garbage collection, dispose and finalize, http handlers and modules, strategy pattern, decorator pattern, factory pattern, Observer, singleton pattern (make it thread safe without using locks... my answer was create an instance on class declaration and return it) 8. JQuery questions about closures, how to sort array in jquery. What are media queries in HTML 5. 9. Its also good to know how to calculate the complexity of an algorithm. They will ask you this. The interviewers didn't ask any scenario based technical questions. They just asked standard theory and these puzzles.