Online Coding Test (1 hour)
2 coding questions were asked

1. 50 mark question: Given a string consisting of * and #. Find minimum jumps to go from index starting to end without landing on * when you can jump of 1 or 2 index right only.
   Given a special case: If you are on a index I (one based) then you could jump to index i + A if A satisfies this criteria: A is number of primes present in range (1, i] and A/i > some given constant.
   IF you can’t reach last index, print “No way!”
   1 < n < 100000

2. 20 mark question: It was a simple question based on array
   Based on this round, around 50 candidates were shortlisted for Technical Interview 1.

Case study round
There were 3 case studies given and you have to solve any 2 problems in 1 hour.
Solution or Psudo code has to be written on paper/word file. This would be discussed in later round to check your thought process.
First of them was to design and implement a way to find out how much a window is visible among many overlapping windows on computer screen.
Second was to find largest square border of black colour in a given m*n matrix.
Third was to design database for a e-commerce company, given some conditions.

Technical Interview 1 (1 hour)
Interviewer asked me how will I detect loop in a LinkedList (just algorithm).
Then he asked me to write a Psudo code to construct BinarySearchTree from a list of input.
I asked him if we have to take duplicates into account too and he said it’s upto you. So I implemented with considering duplicate entries.
Then he asked given a very large list, you have to find kth largest element. Here I asked him if he meant that list is so large that it could not be fit into memory, he said Yes. I wrote just algotithm of “External sorting using divide and conquer” but he was confused and asked to give some another method.
I asked him once again about size of list but this time he said just large but could be fit in memory. This time I told him algorithm using k-size min-heap
Then he asked me to convert given infix notation to postfix notation. I told him that I have forgotten how its done, but if you could give me a postfix for this infix then It would not be hard to come up with an algorithm (I could remember it’s done using stack). He just moved on.
Then he asked me to write a SQL query to find third largest salary in a table. I could not do it.
Then he gave me a logical question. I was able to do this with proper derivation.

Case study debriefing round (30 min)
Interviewer presented me with my submitted file.
He then asked me the approach for 3 question and I told him the assumptions I made and how I came up with this design. Then we optimised it a little bit.
Then he asked me about some questions like how would we optimize these tables to incorporate new field or delete a field.
Then he asked about my approach to reach to solution of second question and asked some tricky questions regarding code(as many people could cheat in case study).
Then he asked about academic projects and how we managed and distributed work in team project.

Behavioural/Managerial round:
This was supposed to be a meet with ZS leaders. Some were candidates were asked just HR questions and some were asked technical questions.
Many people got call for this round but many didn’t.