1. Implement queue using two stacks
2. Longest Palindromic substring (.)
Risposta di colloquio
Anonimo
8 giu 2021
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.