Infibeam Avenues Limited Interview Experience for Software Engineer

The recruitment process was very time taking. We had to wait for around 14 hours starting from the presentation of the company till the last round. In the whole process nowhere there were any questions from your resume or projects or internships. Only and only coding questions and a few puzzles. The interviewers were very friendly and they gave hints for solving the problems in interview rounds. They were looking for an optimised solution for each and every problem and asking time and space complexity for every solution that you propose. The various rounds were:

Round 1: Pen paper test

This round was a pen-paper test. There were 25 MCQs among which 5-6 were general aptitude and rest technical questions. Technical questions were from C, C++, Data Base Management System and  Data Structures. There were two coding questions for which we had to write the algorithm in C format. MCQ were only checked if at least one of the coding solutions were right. The coding questions were:

1.    https://www.geeksforgeeks.org/write-a-c-program-to-find-the-maximum-depth-or-height-of-a-tree/
2.    https://www.geeksforgeeks.org/flatten-a-linked-list-with-next-and-child-pointers/

Round 2: Technical interview 1

In this round, the interviewer started with “Tell me about yourself” and then directly came to coding questions. He asked 4 coding questions and if the approach was clear, no need to code. Else you have to write proper functions for that. The questions asked were:

1. https://www.geeksforgeeks.org/bottom-view-binary-tree/
2. https://www.geeksforgeeks.org/print-left-view-binary-tree/
3. https://www.geeksforgeeks.org/a-program-to-check-if-a-binary-tree-is-bst-or-not/
4. https://www.geeksforgeeks.org/merge-k-sorted-arrays/

Round 3: Technical interview 2

In this round also only coding questions were asked. The questions were:

1. https://www.geeksforgeeks.org/sort-elements-by-frequency/
2. https://www.geeksforgeeks.org/search-in-row-wise-and-column-wise-sorted-matrix/
3. https://math.stackexchange.com/questions/1173409/frogs-and-switches-problem-solving-strategies
4. https://www.geeksforgeeks.org/how-to-turn-off-a-particular-bit-in-a-number/
5. https://www.geeksforgeeks.org/kth-smallestlargest-element-unsorted-array/

Round 4: Technical interview 3

In this round also there were only coding questions:

1. https://www.geeksforgeeks.org/counting-inversions/
2. https://www.geeksforgeeks.org/longest-prefix-also-suffix/
3. https://www.geeksforgeeks.org/find-next-greater-number-set-digits/