1. Implement queue using two stacks
2. Longest Palindromic substring (.)

Question

1. Implement queue using two stacks
2. Longest Palindromic substring (.)

Anonymous · Accepted Answer

I did well in both questions. 
For 2nd question, I suggested a non-DP approach with O(n2) but I think the interviewer was not impressed with this solution.

Phenom

Phenom interview question

Interview Answer

Followed companies

Job searches

Bowls

Want the inside scoop on your own company?