meta | | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
The interviewer was a young man from Tianzhu, who was very nice. The interview began with a simpler question about binary trees, followed by a more complex question regarding a variant of the common “remove adjacent duplicates” problem, which required the removal of all duplicates, not just two adjacent ones.
Technical Questions
- Unique Binary Search Trees
- Remove All Adjacent Duplicates (variant)
Tips & Insights
Good luck to everyone!