s******w
发帖数: 138 | 1 第二次phone interview。还是印度人，很nice。
主要的技术问题：
1. design a data structure, this data structure have four functions: pop, push
, min, top. DO NOT use any stack, queue, list, array or things like this.
2. two binary trees, write a compare function to check if they are equal or
not. equal means they have the same value and same structure.
3. how do you test a calculator.
4. questions about c++, like virtual functions, etc. | s*******t
发帖数: 248 | 2
push
or
Fle virtuaF
l functioFns, etc.
【在 s******w 的大作中提到】
: 第二次phone interview。还是印度人，很nice。
: 主要的技术问题：
: 1. design a data structure, this data structure have four functions: pop, push
: , min, top. DO NOT use any stack, queue, list, array or things like this.
: 2. two binary trees, write a compare function to check if they are equal or
: not. equal means they have the same value and same structure.
: 3. how do you test a calculator.
: 4. questions about c++, like virtual functions, etc.
|
|
