Check out the full Interview Experience of other 15 candidates for Power Programmer Profile here
PROFILE : Power Programmer
PROGRAM : InfyTQ
PACKAGE : 8 lakhs per annum
VERDICT : Rejected
My interview was completely based on my knowledge of Data Structures.
After giving a brief introduction about myself i was asked :
Write a program for finding the reverse of a string without using any predefined function.
I explained him linear time approaches. And he was satisfied.
Write a program to print alternate nodes in a linked list.
I have not prepared myself for such questions but i didn’t gave up, and gave my 10 crucial minutes to solve this problem.
Write a program to print longest substring which is also a palindrome.
Somehow i managed to come up with O(n2) solution. But, his facial expressions were telling me that he wants it in linear time. But, i was unable to code the most optimized solution.
Later, he asked me something me about my projects and discussion went for 7-8 minutes.
But, since i was unable to code the optimized solution, i was rejected.
Later, i was interviewed for SES profile and finally i cracked it
So, all i want to say is, before going to such important interviews, prepare yourself for data structures.
Check out the full Interview Experience of other 15 candidates for Power Programmer Profile here
You cannot find longest palindromic substring in O(n) complexity bro.
The best complexity you can get is o(n^2) using dynamic programing.