r******a
发帖数: 32 | 1 1. talk about yourself
2. what language are u familiar with
3. talk about one of your project
4. design a dictionary(word, meaning) what data structure? what is the
search complexity?
how hash works in O(1)?
5. what senario you use a tree rather than a hash for this problem
6. write a program. array[int] , find two numbers sum to N.
7. write sql to find out how many numbers do each person have?
PhoneNumbers:
name string
phoneNumber string
phoneNumberType ENUM{"HOME","WORK","CELL"} |
z****h
发帖数: 164 | |
p*****2
发帖数: 21240 | |
d***o
发帖数: 181 | |
r******a
发帖数: 32 | 5 not that hard. I made each one, but no feedback.The interviewer was a A San.
【在 p*****2 的大作中提到】
: 电面吗？不算难呀。
|
p*****2
发帖数: 21240 | 6
San.
多久了？不一定是默剧。
【在 r******a 的大作中提到】
: not that hard. I made each one, but no feedback.The interviewer was a A San.
|
y*****n
发帖数: 243 | 7 amazon也会默剧么. pat pat耐心等等吧 |
y*****n
发帖数: 243 | 8 amazon也会默剧么. pat pat耐心等等吧 |
d****o
发帖数: 1055 | 9 4. design a dictionary(word, meaning) what data structure? what is the
search complexity?
how hash works in O(1)?
5. what senario you use a tree rather than a hash for this problem
这题怎么答？
【在 r******a 的大作中提到】
: 1. talk about yourself
: 2. what language are u familiar with
: 3. talk about one of your project
: 4. design a dictionary(word, meaning) what data structure? what is the
: search complexity?
: how hash works in O(1)?
: 5. what senario you use a tree rather than a hash for this problem
: 6. write a program. array[int] , find two numbers sum to N.
: 7. write sql to find out how many numbers do each person have?
: PhoneNumbers:
|
m**a
发帖数: 139 | 10 如果要打印字典的话 需要tree，因为需要按字母排序。
【在 d****o 的大作中提到】
: 4. design a dictionary(word, meaning) what data structure? what is the
: search complexity?
: how hash works in O(1)?
: 5. what senario you use a tree rather than a hash for this problem
: 这题怎么答？
|
|
|
r******a
发帖数: 32 | 11 Got the second phone interview invitation after two weeks....
【在 p*****2 的大作中提到】
:
: San.
: 多久了？不一定是默剧。
|
p*****2
发帖数: 21240 | 12
cong
【在 r******a 的大作中提到】
: Got the second phone interview invitation after two weeks....
|
d****o
发帖数: 1055 | 13 thanks
【在 m**a 的大作中提到】
: 如果要打印字典的话 需要tree，因为需要按字母排序。
|
d****n
发帖数: 17 | 14
Not sure how to answer this questions. Hash works in O(1) since it finds the
value by looking at the location of hash(key)? Do we need to explain the
possible hash function and collision resolution?
select name, count(distinct phonenumbertype) from phonenumbers where
phonenumbertype is not null and phonenumber is not null group by name;
Thanks!
【在 r******a 的大作中提到】
: 1. talk about yourself
: 2. what language are u familiar with
: 3. talk about one of your project
: 4. design a dictionary(word, meaning) what data structure? what is the
: search complexity?
: how hash works in O(1)?
: 5. what senario you use a tree rather than a hash for this problem
: 6. write a program. array[int] , find two numbers sum to N.
: 7. write sql to find out how many numbers do each person have?
: PhoneNumbers:
|
r******a
发帖数: 32 | 15 I gave an example of possible hash function. Let's say the hash value may
refer to the index of an array.If so, we could find that in O(1).
the
【在 d****n 的大作中提到】
:
: Not sure how to answer this questions. Hash works in O(1) since it finds the
: value by looking at the location of hash(key)? Do we need to explain the
: possible hash function and collision resolution?
: select name, count(distinct phonenumbertype) from phonenumbers where
: phonenumbertype is not null and phonenumber is not null group by name;
: Thanks!
|
h******0
发帖数: 427 | |
