round 1 telephonic interview intro,why do u want to join this company,how did you come to know about this job,dsa ques how to find the middle of a circular linked list rounf 2 online test hacckerrank based 2 ques 30 mins Q1 - similar to dutch national flag problem Q2 - http://www.geeksforgeeks.org/reverse-an-array-without-affecting-special-characters/ face to face interview round 1 repeated and missing no in a array , longest substring with non repeated characters ques based on online test that i wrote in the beginning round 2 update a bst such that each node has value = its value + sum of all larger nodes you have something like tweeter in its naive state , how will you show the top 10 users(having most no of tweets) at any point of time round 3 (manager round) searching no in a rotated and sorted array how will u test this program round 4 (taken by avp) weaknesses,strengths,why did u choose this company,how will you test a code which adds no from a to b. They look for the approach and how you think. Interviewers are very friendly and end of every round ask if you have any questions

Given an unsorted array find the two numbers which will give you the maximum product? Needed an optimized solution.