Reverse a string based on opening/closing curly brackets.
input: {I{am}paypal}
output -> lapyapaml
I tried to solve this using recursion first, but then she gave couple more examples to show that doesnt work. Then I tried to solve it using stack. Unfortunately I couldnt solve it within the timeframe.
Number of islands graph traversal problem
This is a frequently asked question, so I knew the solution. I solved the problem in 20 minutes, but literally she didnt allow me to run saying that time is up and she has no time to check it.
These are the comments passed by Interviewer:
She never bothered to give any hints (which is fine, some interviewers dont prefer to give hints and see if candidate performs without hints). But the comment that she made right after the first question literally stunned me. We had about 20-25 minutes left and she wanted to take a break instead of giving me the second question. She never bothered to run the solution for next question and stepped out of the meeting.
I passed my feedback to the HR and moved on.
In a nutshell, I would never ever apply to Paypal again. I would like to avoid working with people of this attitude.