Department : ECE
CGPA : 8.92
The written test was meant for shortlisting the candidates who had applied for the company. There were three questions, all of which could be comfortably solved if the clarity in dynamic programming concordant with arrays and strings is sound. Out of the three questions, one, based on arrays was very novice. It was based on making some given pattern. From more than 100 students, if I am not faltering in numbers, about 20 students were shortlisted for the interviews.
This was a sort of explanatory session, in which you explain the methods or the approaches you might have had thought while solving the previously mentioned written test. They asked for some improvements in the already written code. For example, in one of the questions where the time complexity was O(n^3), they stressed for about 10 minutes to write the same code with a better time complexity.
They also focussed on trees a lot. They mentioned a BST and asked to print its envelope. Each time I answered, they modified the question and asked me to redo the same. One thing which helped me was the genial nature of the interviewers. They (there were 2 in my panel) were very soft in speech and always gave me empressement whenever I moved ahead in the task assigned; =this boosted confidence and I think I answered what they had anticipated. So don't feel panic when you are stuck at some point. Take your own sweet time and the interviewers always appreciate this.
This was a bit challenging round for me. The interviewer( who was the senior most among the people came to the campus) was very friendly and immediately made me feel at home when he started his first question on sorting. He asked about quick sort and a short comparative analysis of the time and space complexities of major sorting algorithms. Though these type of questions were expected, I answered them quite well, not losing a bit of my composure. Then, he went on to asking questions on strings,the array of pointers and some simple programs. Everything was going on quite well by this time. Then he got some phone call and he asked one of his colleagues to resume the interview. This fellow inchoated his questions from graphs and trees. I think some of the questions were of the type what we find in geeks for geeks. He asked an algorithm based on graphs. I humbly told him that I was not very conversant with graph theory and he shifted again to BST. He asked about traversal of trees which can give numbers in a particular order, viz., ascending and descending. Now the old interviewer returned and gave me a pattern to print. He gave me 15 minutes to solve and told firmly that if you solve this, you are in; otherwise we are happy to interview you. They both chuckled and went away. After 20 minutes, they returned, only to find out that I had solved that.
They asked me about my family and my hobbies. When I told reading, he asked what was the last book I had finished.
They asked FactSet in general. CEO, Headquarter and products. I told them, not very satisfactorily, I believe.
Previously, how many interviews I faced?
At last when I was leaving the cabin, pretty tensed (since I was rejected 6 times previously in the interviews in the last 5 days), they sensing my nervousness, told me- "Don't worry, you will get hired." These were the best words I heard that complete afternoon.
Just be cool. It is always ok not to know everything they ask. Just tell them that you are not much familiar with the topic but would be zealous to learn it. At such times, they look for an eagerness to learn and try to drift the interview in the area of your expertise, if given a chance.