j********x
发帖数: 2330 | 1 PS1: 1. Merge sorted linked lists; 2. Iterative inorder traversal of
binary tree
PS2: 1. Inorder successor of binary search tree;
onsite: 1. infix expression evaluation of integers and + - * /; 2.
implement a system to route packets based on their priority; implement
associative container Map; 3. Given n nodes, each node has 2 blocking
functions: send(int to_id, int msg); recv(int from_id); each node has a
value; design a method to distribute the sum of all values on every node to
all nodes; 4. power. design a Amazon product page chat service so that
people browsing on the same product page can chat with each other.
onsite: 1. Flatten a binary tree; 2. implement a big integer's
addition; with addition, minus, multiplication implemented, implement
division; 3. combination sum, design a battleship game; 4. implement reader-
writer lock with mutex and conditional variable.
PS1: 1. power; other misc staff
PS2: 1. intersection of sorted lists; 2. merge multiple sorted
lists; 3. how to accelerate the merging of sorted lists (parallelism)
Onsite: 1. design indexing method of increasing but not necessarily
consecutive sequence numbers, each sequence number associated with memory
address;
2. given a function of get_connection(int uid
), implement find_1_hop(), find_2_hop(), find_3_hop(); 3. implement delayed
scheduler: Future schedule(int target_time, Runnable task); 4. design Amazon
's product page, with user info, recommendation and product information,
include the details of the data storage; 5. given a linked list with struct
node { node* up, node* down, node* prev, node* next}, assuming no cycles,
flatten the linked list; 6. Roman to integer, integer to roman.
onsite: 1. what is TCP sliding window; 2. in an array starting with 1
's (consecutively) and following with 0's, find the boundary of 1's; 3.
design a distributed games with consistent interaction between players, the
game is assumed on a 2D plane; 4. Given multiple printers on a grid map,
find the location to place papers such that the sum of distance from the
paper to all printers is minimal; note that there are obstacles in the grid
map. What if there is no obstacles? 5. Quick selection, and how to optimize
on multi-core machines.
onsite: skyline |
c********w
发帖数: 2438 | |
c********p
发帖数: 1969 | |
p*****2
发帖数: 21240 | 4
EIP上有
【在 c********p 的大作中提到】
: FB 那个什么意思？
: 什么是skyline？
|
h*****a
发帖数: 1718 | 5 多谢。FB为啥就一道题？电话面试的？
to
【在 j********x 的大作中提到】
: PS1: 1. Merge sorted linked lists; 2. Iterative inorder traversal of
: binary tree
: PS2: 1. Inorder successor of binary search tree;
: onsite: 1. infix expression evaluation of integers and + - * /; 2.
: implement a system to route packets based on their priority; implement
: associative container Map; 3. Given n nodes, each node has 2 blocking
: functions: send(int to_id, int msg); recv(int from_id); each node has a
: value; design a method to distribute the sum of all values on every node to
: all nodes; 4. power. design a Amazon product page chat service so that
: people browsing on the same product page can chat with each other.
|
r**h
发帖数: 1288 | 6 Given a list of contiguous buildings by width and height, find the area of
the largest rectangle that can be embeded in the resulting skyline.
说的是这一题吗？
【在 p*****2 的大作中提到】
:
: EIP上有
|
j********x
发帖数: 2330 | 7 一次就挂了当然就一道题
【在 h*****a 的大作中提到】
: 多谢。FB为啥就一道题？电话面试的？
:
: to
|
h*****a
发帖数: 1718 | 8 pat, skyline这道题不容易，不适合电面。
L的题也挺难的，那个flatten linked list需要保留结构么？还是只要所有节点连起来
就行？
【在 j********x 的大作中提到】
: 一次就挂了当然就一道题
|
z*********8
发帖数: 2070 | 9 什么是EIP?
【在 p*****2 的大作中提到】
:
: EIP上有
|
x*********w
发帖数: 533 | 10 design indexing method of increasing but not necessarily
consecutive sequence numbers;
啥意思？？ |
|
|
p*****2
发帖数: 21240 | 11
感觉LZ被黑了。
【在 j********x 的大作中提到】
: 一次就挂了当然就一道题
|
x*********w
发帖数: 533 | 12 L家的那个什么罗马数字转来转去的真恶心，还有什么大数乘除 |
x****m
发帖数: 1084 | |
s*****r
发帖数: 43070 | 14 LZ是搞distribution的吗？怎么每家都问类似问题，看着头大 |
r********d
发帖数: 7742 | 15 楼主虽然话糙脾气爆，但是从发帖来看是个实在人啊。
赞一个，呵呵。
to
【在 j********x 的大作中提到】
: 一次就挂了当然就一道题
|
w******j
发帖数: 185 | |
J****3
发帖数: 427 | |
e*****n
发帖数: 316 | |
x*****0
发帖数: 452 | |
Y********f
发帖数: 410 | 20 skip list?
【在 x*********w 的大作中提到】
: L家的那个什么罗马数字转来转去的真恶心，还有什么大数乘除
|
|
|
v***n
发帖数: 562 | |
j********x
发帖数: 2330 | 22 PS1: 1. Merge sorted linked lists; 2. Iterative inorder traversal of
binary tree
PS2: 1. Inorder successor of binary search tree;
onsite: 1. infix expression evaluation of integers and + - * /; 2.
implement a system to route packets based on their priority; implement
associative container Map; 3. Given n nodes, each node has 2 blocking
functions: send(int to_id, int msg); recv(int from_id); each node has a
value; design a method to distribute the sum of all values on every node to
all nodes; 4. power. design a Amazon product page chat service so that
people browsing on the same product page can chat with each other.
onsite: 1. Flatten a binary tree; 2. implement a big integer's
addition; with addition, minus, multiplication implemented, implement
division; 3. combination sum, design a battleship game; 4. implement reader-
writer lock with mutex and conditional variable.
PS1: 1. power; other misc staff
PS2: 1. intersection of sorted lists; 2. merge multiple sorted
lists; 3. how to accelerate the merging of sorted lists (parallelism)
Onsite: 1. design indexing method of increasing but not necessarily
consecutive sequence numbers, each sequence number associated with memory
address;
2. given a function of get_connection(int uid
), implement find_1_hop(), find_2_hop(), find_3_hop(); 3. implement delayed
scheduler: Future schedule(int target_time, Runnable task); 4. design Amazon
's product page, with user info, recommendation and product information,
include the details of the data storage; 5. given a linked list with struct
node { node* up, node* down, node* prev, node* next}, assuming no cycles,
flatten the linked list; 6. Roman to integer, integer to roman.
onsite: 1. what is TCP sliding window; 2. in an array starting with 1
's (consecutively) and following with 0's, find the boundary of 1's; 3.
design a distributed games with consistent interaction between players, the
game is assumed on a 2D plane; 4. Given multiple printers on a grid map,
find the location to place papers such that the sum of distance from the
paper to all printers is minimal; note that there are obstacles in the grid
map. What if there is no obstacles? 5. Quick selection, and how to optimize
on multi-core machines.
onsite: skyline |
c********w
发帖数: 2438 | |
c********p
发帖数: 1969 | |
p*****2
发帖数: 21240 | 25
EIP上有
【在 c********p 的大作中提到】
: FB 那个什么意思？
: 什么是skyline？
|
h*****a
发帖数: 1718 | 26 多谢。FB为啥就一道题？电话面试的？
to
【在 j********x 的大作中提到】
: PS1: 1. Merge sorted linked lists; 2. Iterative inorder traversal of
: binary tree
: PS2: 1. Inorder successor of binary search tree;
: onsite: 1. infix expression evaluation of integers and + - * /; 2.
: implement a system to route packets based on their priority; implement
: associative container Map; 3. Given n nodes, each node has 2 blocking
: functions: send(int to_id, int msg); recv(int from_id); each node has a
: value; design a method to distribute the sum of all values on every node to
: all nodes; 4. power. design a Amazon product page chat service so that
: people browsing on the same product page can chat with each other.
|
r**h
发帖数: 1288 | 27 Given a list of contiguous buildings by width and height, find the area of
the largest rectangle that can be embeded in the resulting skyline.
说的是这一题吗？
【在 p*****2 的大作中提到】
:
: EIP上有
|
j********x
发帖数: 2330 | 28 一次就挂了当然就一道题
【在 h*****a 的大作中提到】
: 多谢。FB为啥就一道题？电话面试的？
:
: to
|
h*****a
发帖数: 1718 | 29 pat, skyline这道题不容易，不适合电面。
L的题也挺难的，那个flatten linked list需要保留结构么？还是只要所有节点连起来
就行？
【在 j********x 的大作中提到】
: 一次就挂了当然就一道题
|
z*********8
发帖数: 2070 | 30 什么是EIP?
【在 p*****2 的大作中提到】
:
: EIP上有
|
|
|
x*********w
发帖数: 533 | 31 design indexing method of increasing but not necessarily
consecutive sequence numbers;
啥意思？？ |
p*****2
发帖数: 21240 | 32
感觉LZ被黑了。
【在 j********x 的大作中提到】
: 一次就挂了当然就一道题
|
x*********w
发帖数: 533 | 33 L家的那个什么罗马数字转来转去的真恶心，还有什么大数乘除 |
x****m
发帖数: 1084 | |
s*****r
发帖数: 43070 | 35 LZ是搞distribution的吗？怎么每家都问类似问题，看着头大 |
r********d
发帖数: 7742 | 36 楼主虽然话糙脾气爆，但是从发帖来看是个实在人啊。
赞一个，呵呵。
to
【在 j********x 的大作中提到】
: 一次就挂了当然就一道题
|
w******j
发帖数: 185 | |
J****3
发帖数: 427 | |
e*****n
发帖数: 316 | |
x*****0
发帖数: 452 | |
|
|
Y********f
发帖数: 410 | 41 skip list?
【在 x*********w 的大作中提到】
: L家的那个什么罗马数字转来转去的真恶心，还有什么大数乘除
|
v***n
发帖数: 562 | |
P****d
发帖数: 137 | 43 发现这里面的设计题都不会。。。。
to
【在 j********x 的大作中提到】
: 一次就挂了当然就一道题
|
n******n
发帖数: 567 | 44 4. Given multiple printers on a grid map,
find the location to place papers such that the sum of distance from the
paper to all printers is minimal; note that there are obstacles in the grid
map. What if there is no obstacles?
没看懂，为什么贴的是paper？ |
