c*****q
发帖数: 44 | 1 1st Interview
Introduction to master project
1. whether there is a cycle in linked list? time and space? how to make it
no cycle?
2. inline? adv vs. disadv? if all function are inline, will still treat as
inline? why?
Question and answer
2nd Interview
1. We have huge data flow, data come in at morning and at night we want to
get the repeated char with the min recurrences?
in place sort? data too huge, other method!
use hashtable. (in fact could just use 256 array if ascii). okay, time
complexity ?
2. how to find a number which is just smaller than given value? write code.
Is there anyway could terminate earlier?
what if the array is already sorted? binary search. time complexity?
3. STL container? Introduce set.
how does map sort the keys? use less functions.
code: given a class, write its < function. (okay, he was arranging 3rd
interview, so I happily write a wrong function 囧) NEED to pay attention to
type casting: double = (double)int/(double)int.
3rd Interview --- Senior Eng
1. talk about your project: very detailed, including all the processes and
data structure.
why C++? Why BB? Why CS?....
2. reverse the string:coding (囧 one bug! )
Difference between C-style string & C++ string; others cannot remember...
3. Questions!
4th HR --- General Questions
Now, waiting for the letter...bless me... |
l*****a
发帖数: 14598 | 2 先顶后看
【在 c*****q 的大作中提到】
: 1st Interview
: Introduction to master project
: 1. whether there is a cycle in linked list? time and space? how to make it
: no cycle?
: 2. inline? adv vs. disadv? if all function are inline, will still treat as
: inline? why?
: Question and answer
: 2nd Interview
: 1. We have huge data flow, data come in at morning and at night we want to
: get the repeated char with the min recurrences?
|
l*****a
发帖数: 14598 | 3 bless
major?
no online test?
【在 c*****q 的大作中提到】
: 1st Interview
: Introduction to master project
: 1. whether there is a cycle in linked list? time and space? how to make it
: no cycle?
: 2. inline? adv vs. disadv? if all function are inline, will still treat as
: inline? why?
: Question and answer
: 2nd Interview
: 1. We have huge data flow, data come in at morning and at night we want to
: get the repeated char with the min recurrences?
|
c*****q
发帖数: 44 | 4 Thank you.
CS but 半路出家。校园面试选中简历后，就直接一对一的面了
【在 l*****a 的大作中提到】
: bless
: major?
: no online test?
|
l*******6
发帖数: 37 | |
t**l
发帖数: 23 | |
p****y
发帖数: 67 | 7 bless, 没online test真好
campus interview 的那天我在别家onsite，只能走正规程序，于是我又是死在online
test |
c*****q
发帖数: 44 | 8 谢谢~
他家的online都挺难的，我第一次错过了的时候 也就直接online。。
online
【在 p****y 的大作中提到】
: bless, 没online test真好
: campus interview 的那天我在别家onsite，只能走正规程序，于是我又是死在online
: test
|
c*****q
发帖数: 44 | 9 谢谢~
【在 l*******6 的大作中提到】
: Bless~~~~~
|
c*****q
发帖数: 44 | 10 谢谢~~
【在 t**l 的大作中提到】
: bless
|
|
|
c*****q
发帖数: 44 | 11 刚刚接到电话，收到offer
在此小女真心感谢板上的大牛们和前人们的讨论以及面经！
----------------------------------------------------
1st Interview
Introduction to master project
1. whether there is a cycle in linked list? time and space? how to make it
no cycle?
2. inline? adv vs. disadv? if all function are inline, will still treat as
inline? why?
Question and answer
2nd Interview
1. We have huge data flow, data come in at morning and at night we want to
get the repeated char with the min recurrences?
in place sort? data too huge, other method!
use hashtable. (in fact could just use 256 array if ascii). okay, time
complexity ?
2. how to find a number which is just smaller than given value? write code.
Is there anyway could terminate earlier?
what if the array is already sorted? binary search. time complexity?
3. STL container? Introduce set.
how does map sort the keys? use less functions.
code: given a class, write its < function.
3rd Interview --- Senior Eng
1. talk about your project: very detailed, including all the processes and
data structure.
why C++? Why BB? Why CS?....
2. reverse the string:coding
Difference between C-style string & C++ string; others cannot remember...
3. Questions？!
4th HR --- General Questions
Now, waiting for the letter...bless me... |
l*****a
发帖数: 14598 | 12 先顶后看
【在 c*****q 的大作中提到】
: 1st Interview
: Introduction to master project
: 1. whether there is a cycle in linked list? time and space? how to make it
: no cycle?
: 2. inline? adv vs. disadv? if all function are inline, will still treat as
: inline? why?
: Question and answer
: 2nd Interview
: 1. We have huge data flow, data come in at morning and at night we want to
: get the repeated char with the min recurrences?
|
l*****a
发帖数: 14598 | 13 bless
major?
no online test?
【在 c*****q 的大作中提到】
: 1st Interview
: Introduction to master project
: 1. whether there is a cycle in linked list? time and space? how to make it
: no cycle?
: 2. inline? adv vs. disadv? if all function are inline, will still treat as
: inline? why?
: Question and answer
: 2nd Interview
: 1. We have huge data flow, data come in at morning and at night we want to
: get the repeated char with the min recurrences?
|
c*****q
发帖数: 44 | 14 Thank you.
CS but 半路出家。校园面试选中简历后，就直接一对一的面了
【在 l*****a 的大作中提到】
: bless
: major?
: no online test?
|
l*******6
发帖数: 37 | |
t**l
发帖数: 23 | |
p****y
发帖数: 67 | 17 bless, 没online test真好
campus interview 的那天我在别家onsite，只能走正规程序，于是我又是死在online
test |
c*****q
发帖数: 44 | 18 谢谢~
他家的online都挺难的，我第一次错过了的时候 也就直接online。。
online
【在 p****y 的大作中提到】
: bless, 没online test真好
: campus interview 的那天我在别家onsite，只能走正规程序，于是我又是死在online
: test
|
c*****q
发帖数: 44 | 19 谢谢~
【在 l*******6 的大作中提到】
: Bless~~~~~
|
c*****q
发帖数: 44 | 20 谢谢~~
【在 t**l 的大作中提到】
: bless
|
c*****q
发帖数: 44 | 21
【在 c*****q 的大作中提到】
: 刚刚接到电话，收到offer
: 在此小女真心感谢板上的大牛们和前人们的讨论以及面经！
: ----------------------------------------------------
: 1st Interview
: Introduction to master project
: 1. whether there is a cycle in linked list? time and space? how to make it
: no cycle?
: 2. inline? adv vs. disadv? if all function are inline, will still treat as
: inline? why?
: Question and answer
|
