Round1: paper pen written test Q1: Write function to add all no in array without using loop ans: Use recursion Q2: Write function to product of element like a=[2,5,7] then output b=[10,14,35] without using loop ans: Use recursion Q3: Write function to return position of number in sorted Array ans: use binary search and remaining two was easy but i don't remember. sorry :( Round2: In-person Q: convert 1-d array into 2-d array according to condition. difficulty level :pretty easy. Q: wrong label puzzle - http://monkeypuzzles.org/puzzles/three-boxes-with-incorrect-labels. Q: find second largest no in one pass. sol- http://www.sanfoundry.com/c-program-largest-two-numbers-given-array/ Q:100 door puzzzle -http://www.crazyforcode.com/100-lockerdoors-puzzle/ Tips: Don't prepare for puzzle.puzzle are not elimination question.They want coders not puzzle solver. Round3: Hr round work culture and company : Don't know about work culture.Very small team of people.Founding team comes to take interview.They are like startups.Join if you are willing to work much more than 9 to 5 and sometimes weekends.

what is collections