Applied through an online application and got a phone interview three weeks later.

The phone interview did not involve coding; it just asked me to explain two algorithm questions:

1. Given two stack classes, how to implement a queue with dequeue and enqueue operations, both with O(1) time complexity.
2. Find the longest palindrome in a string. The interviewer kept asking if I could provide a faster solution. I ended up giving an O(n^2) solution.

Find the longest palindrome in a string.

Just keep asking if I could give a faster solution. I ended up giving an O(n^2) solution.