Round 1(coding round)- Given a matrix find all possible combinations of numbers which are in different rows for example consider a matrix [1 2 3] [4 5 6 ] [ 7 8 9] and expected answer is (1 4 7)(1 4 8 ) (1 4 9) (1 5 7) (1 5 8) (1 5 9) and so on ... The solution is easy by applying backtracking and recursion Round 2 - There were 2 types of questions 1- data structures 2- OOPS concepts 1) data structures questions- 1: You are given an array which contains both positive and negative numbers and you are supposed to find 3 numbers whose product is maximum 2: delete a node in the linked list which is pointed by some pointer , there is not head pointer so you can't traverse the linked list from start 3: given a binary tree find whether it is binary search tree or not 4: find the middle element of the linked list 2) OOPS concepts- Define overloading and overriding , and difference between them Round 3: There were some basic question and some data structure questions 1) Stages of compiler design 2)Importance of register variables in C 3) volatile key word in C 4) volatile key word in the context of code optimization 5) there is a tree in the main memory of computer, you need to store it so that you can reconstruct the tree what will your approach 6) find the diameter of binary tree where diameter=length of left subtree + length of right subtree+1(for root) 7) consider the situation that you want to update an existing android system what will be your approach Round 4: This is the most challenging and exciting round in the overall interview process 1) Questions about final year project 2)union of 2 arrays ( you are expected to know complexity of each approach before telling the approach, brute force or naive approach should mostly avoid, use of collections such as set and map are not allowed even if you want to use them you should know internal working of those collections) 3) Difference between linked list and tree (this one was crazy and I think interviewer was testing my confidence and patience both, according to him linked list is not necessarily a linear data structure) 4) 25 horses puzzle 5)There are n weights and m buckets, you are supposed to write an algorithm to distribute these n weights in to m buckets evenly For example consider that there are 4 weights of values 2,4,6,8 and there are 2 buckets then distribution will be 2 and 8 in one bucket , 4 and 6 in another one) although the problem seems to be easy at first glance, it is difficult to write a generic algorithm for this problem. There was one more round but I was eliminated from 4'th round
