s*********t
发帖数: 25 | 1 1 hour.
Not very hard. Two coding questions (write using a online collaborating tool
).
1 Merge two sorted int arrays into a third one.
2 Merge two sorted arrays into the first one, assuming the first one has
enough empty space to hold elements from both arrays. |
e******a
发帖数: 176 | 2 for 2, start from the ends of the three arrays?
tool
【在 s*********t 的大作中提到】
: 1 hour.
: Not very hard. Two coding questions (write using a online collaborating tool
: ).
: 1 Merge two sorted int arrays into a third one.
: 2 Merge two sorted arrays into the first one, assuming the first one has
: enough empty space to hold elements from both arrays.
|
i**********e
发帖数: 1145 | 3 no need 3rd array...
use 2 pointers, start from the end of both arrays.
一些常见面试题的答案与总结 -
http://www.ihas1337code.com
【在 e******a 的大作中提到】
: for 2, start from the ends of the three arrays?
:
: tool
|
i**9
发帖数: 351 | |
h**********d
发帖数: 4313 | 5 请问楼主facebook是网投的吗，我投了几次都没反应，谢谢 |
s*********t
发帖数: 25 | 6 Yes. online submission
【在 h**********d 的大作中提到】
: 请问楼主facebook是网投的吗，我投了几次都没反应，谢谢
|
s*********t
发帖数: 25 | 7 Second round. Old questions
implement double sqrt(double d);
design a data structure to support push, pop, getMinimum all with O(1)
complexity.
tool
【在 s*********t 的大作中提到】
: 1 hour.
: Not very hard. Two coding questions (write using a online collaborating tool
: ).
: 1 Merge two sorted int arrays into a third one.
: 2 Merge two sorted arrays into the first one, assuming the first one has
: enough empty space to hold elements from both arrays.
|
j*****u
发帖数: 1133 | 8 classic questions in round 2 as well, you must did well.
thx for sharing!
【在 s*********t 的大作中提到】
: Second round. Old questions
: implement double sqrt(double d);
: design a data structure to support push, pop, getMinimum all with O(1)
: complexity.
:
: tool
|
x******y
发帖数: 361 | 9 wow, you had easy ones. Such good luck!
【在 s*********t 的大作中提到】
: Second round. Old questions
: implement double sqrt(double d);
: design a data structure to support push, pop, getMinimum all with O(1)
: complexity.
:
: tool
|
