s**********e
发帖数: 326 | 1 background: phd in math, master in stats
first round: two interviewers, sudo code is fine
ask why choose software developer instead of quant?, why not interested in
quant.
Two sorted arrays, how to get the merged sorted one ( from biggest to
smallest). If not sorted, use quick sort to sort both of them and merge.
They ask about sort-merge or merge-sort, which one is better? Assume the
same length. Then ask me to write a merge function in five minutes , when I
am writing half of the codes he asked me to stop, since he said he knew that
I can get that.
Then ask quick sort, show them the idea of quick sort and how the partition
works, ask me to show them the worst extreme case where the time complexity
is O(n^2).
For these sort algorithms, when should use which?
Then talk about binary search tree, ask me to say the advantage of this data
structure.
For a binary tree how to find the depth of it? Just need to show idea.
Linked list, how to find length, how to find middle one?
Matrix, two dimension array, if sorted both in row and in column, how to
locate a given integer or return nonexistent.
Problem about logistic regression and ask me related methods.
Ask me how the integer stored in memory, for bit operation , how to write a
function change the third digits from right to be 1.
Second round: should be manager, Indian guy
Ask why not quant? Why software developing? If have offer from Bloomberg,
Google which one do you choose? If you worked at bloomberg one year and got
an offer from google, which one will you choose?
Any course taken in computer science?
Give me a code, ask whether it is correct or not? Related to pointer.
Ask me a complete a function related passing by value or address.
Third round: should be hr, a lady
most are behavior questions.
The onsite interview took took about two hours and half totally.
BB面试对non cs的很简单，大家可以试试。 | b*******e
发帖数: 86 | 2 谢谢楼主！！！
I
that
【在 s**********e 的大作中提到】
: background: phd in math, master in stats
: first round: two interviewers, sudo code is fine
: ask why choose software developer instead of quant?, why not interested in
: quant.
: Two sorted arrays, how to get the merged sorted one ( from biggest to
: smallest). If not sorted, use quick sort to sort both of them and merge.
: They ask about sort-merge or merge-sort, which one is better? Assume the
: same length. Then ask me to write a merge function in five minutes , when I
: am writing half of the codes he asked me to stop, since he said he knew that
: I can get that.
| B******5
发帖数: 4676 | | d********t
发帖数: 9628 | 4 唉，我onsite全是弱项brainteaser，一点编程算法都没有，结果挂了。
I
that
【在 s**********e 的大作中提到】
: background: phd in math, master in stats
: first round: two interviewers, sudo code is fine
: ask why choose software developer instead of quant?, why not interested in
: quant.
: Two sorted arrays, how to get the merged sorted one ( from biggest to
: smallest). If not sorted, use quick sort to sort both of them and merge.
: They ask about sort-merge or merge-sort, which one is better? Assume the
: same length. Then ask me to write a merge function in five minutes , when I
: am writing half of the codes he asked me to stop, since he said he knew that
: I can get that.
| l*****a
发帖数: 14598 | 5 别灰心
明年再申请好了
【在 d********t 的大作中提到】
: 唉，我onsite全是弱项brainteaser，一点编程算法都没有，结果挂了。
:
: I
: that
| s*******n
发帖数: 499 | 6 cong!
看着跟我面的题目都一样，连后面两个人好像也一样
bless
I
that
【在 s**********e 的大作中提到】
: background: phd in math, master in stats
: first round: two interviewers, sudo code is fine
: ask why choose software developer instead of quant?, why not interested in
: quant.
: Two sorted arrays, how to get the merged sorted one ( from biggest to
: smallest). If not sorted, use quick sort to sort both of them and merge.
: They ask about sort-merge or merge-sort, which one is better? Assume the
: same length. Then ask me to write a merge function in five minutes , when I
: am writing half of the codes he asked me to stop, since he said he knew that
: I can get that.
| g*****i
发帖数: 2162 | 7 恭喜楼主夫妇.
If have offer from Bloomberg,Google which one do you choose? If you worked
at bloomberg one year and got an offer from google, which one will you
choose?
这问题有难度啊,怎么回答? | s**********e
发帖数: 326 | 8 自然要很坚定很真诚的说我一定会选择Bloomberg的，因为我更喜欢finance,
bloomberg做的东西我更感兴趣，更能带给我成就感，等等有的没的，然后使劲编造为
什么选择BB而不是GOOGLE的各种理由。
【在 g*****i 的大作中提到】
: 恭喜楼主夫妇.
: If have offer from Bloomberg,Google which one do you choose? If you worked
: at bloomberg one year and got an offer from google, which one will you
: choose?
: 这问题有难度啊,怎么回答?
| s**********e
发帖数: 326 | 9 我老公面完回来还很遗憾没碰到brainteaser题，他觉得brainteaser是他的强项。好在
问的data structure和algorithm的题都是之前练过的。感觉brainteaser偶然性太大了
。。
【在 d********t 的大作中提到】
: 唉，我onsite全是弱项brainteaser，一点编程算法都没有，结果挂了。
:
: I
: that
| d********t
发帖数: 9628 | 10 伤心了，不申了。
【在 l*****a 的大作中提到】
: 别灰心
: 明年再申请好了
| r******6
发帖数: 808 | 11 how to choose between sort first or merge first?
assume same length, first one is O(nlogn) O(nlogn) 2n
second is O(2nlog(2n))
how to compare them without the coefficient of the O?
sorry that can't type Chinese now.... | x******a
发帖数: 6336 | 12 thank you for sharing. why not quant怎么回答？
first is n^3 (ln n)^2, second is n(log n).
【在 r******6 的大作中提到】
: how to choose between sort first or merge first?
: assume same length, first one is O(nlogn) O(nlogn) 2n
: second is O(2nlog(2n))
: how to compare them without the coefficient of the O?
: sorry that can't type Chinese now....
| r****t
发帖数: 10904 | 13 数学 PhD + stats master 怎么答 why not quant?
【在 x******a 的大作中提到】
: thank you for sharing. why not quant怎么回答？
: first is n^3 (ln n)^2, second is n(log n).
|
|
