有猫咪要来短住些日子，该做哪些准备？# pets - 心有所宠
s*e
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的很简单，大家可以试试。
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的很简单，大家可以试试。
