Working with energetic people reduces communication costs.
There was pressure for working on similar projects with other teams.
1. Introduce for both sides. 2. Coding: Merge two binary search trees to build one BST. (Inorder traversal + sorted array merge + build a new tree from inorder array) 3. Ask reverse questions. Total time: 45 minutes.
It was a coding interview with only one question. Given some bus routes and a source and destination stop, determine the minimum number of buses needed to take. The interviewer was serious and provided only a few pieces of feedback.
I applied online. This was a one-hour-long interview. The interviewer was cold. He asked me a lot of computer fundamental knowledge, like data structures, and he asked a lot about my resume. The coding part was a hard one, which I couldn't figure ou
1. Introduce for both sides. 2. Coding: Merge two binary search trees to build one BST. (Inorder traversal + sorted array merge + build a new tree from inorder array) 3. Ask reverse questions. Total time: 45 minutes.
It was a coding interview with only one question. Given some bus routes and a source and destination stop, determine the minimum number of buses needed to take. The interviewer was serious and provided only a few pieces of feedback.
I applied online. This was a one-hour-long interview. The interviewer was cold. He asked me a lot of computer fundamental knowledge, like data structures, and he asked a lot about my resume. The coding part was a hard one, which I couldn't figure ou