Status: Software Engineer at British Telecom
Position: Software Development Engineer-|| at SnapDeal
Location: Bangalore, India

Round-1 (around 1-2 hr): F2F
Q1. In an array all element are duplicate except one, how will you find that element?
Q2. An array of size N contains an element within a range from 1 ...(N+1) elements, find out which element is not present in an array?
Q3. Detect loop in a linked list?
Q4. Tell the point from where the loop starts in a list?(follow up question after above)
Q5. how will you identify whether two list intersects?(without using extra memory)
Q6. convert prefix to postfix expression
Q7. Find in an array, if there exist any sub-array with zero-sum.
Q8. About projects

Round-2 (around 2 hr): F2F-
Q1.What design pattern you have used so far?
Q2.how will you merge two sets(basically array contains unique elements) without using hashmap or HashSet?
Ex- A={1,2,3,4} B={4,2} res={1,2,3,4}
Q3. what will be the complexity of above one?
Q4. Design TicTacToe
Q5. Dumping box, scan an input array and dump their element in two different stacks alternatively using two threads without deadlock(expectation was to use of wait and notify method properly) similar to print even & odd number with two different thread alternatively.

If you cleared above one then base on the working location
If hiring is for bangalore then 1 VC(Video Conferencing) & 1 HR round.
**For Gurugram location -->**2 VC & 1 HR round.

Will update the VC round information once it's done(currently, put it on hold)

*Tips: First round is tuff if you clear that one then your 50% work is done.