Campus Recruitment

First, there was a written round. The MCQs were easy. The programming questions were:

1. Print out the last 10 lines of a string.
2. Level-wise printing of a binary tree.

First Interview:

1. Convert "aaabbcccsss" to "a3b2c3s3" in-place.
2. Find if a linked list is circular.

Second Interview:

1. Two extra pointers in nodes of a BST, prev and next. Set them to the inorder predecessor and successor, respectively.

I gave an n log n average solution. The interviewer asked me to write the code, which took me nearly 25 minutes. I was rejected after this round.

The interviewer was expecting an O(n) solution in Round 2 but told me to code an O(n log n) solution, which took too much time. I was disappointed.