面经:
Bloomberg
电面:mapreduce一道题(和search engine有关,build index),hashtable实现相关问
题,智力题(不难),开放题(match persons and teams, each person has a rank for
each team, each team also has a rank for each person, design the matching
algorithm)
onsite:cancel了。开始的时候目的很单纯,只是想免费去纽约玩,后来发现只给报销
一晚的住宿,而且要穿正装(没有正装啊!还要花钱买啊!), 而且坐飞机太久太累
Rocket Fuel
code challenge: auto racer
电面1:
第一题:贪心
Given a number, can you remove k digits from the number so that the new
formatted number is smallest possible.
input: n = 1432219, k = 3
output: 1219
第二题:DP
BT(binary tree), want to find the LIS(largest independent set) of the BT
LIS: if the current node is in the set, then its chilren should not be in
the set. So that the set has the largest number of nodes.
电面2:
第一题:Median of Two Sorted Arrays
第二题:DP
一个二维数组,元素是0或1,找出最大的由1构成的"X"形状
onsite:
1. print all subsets
system design(N topics, publishers, subscribers, scalability, distributed)
the most frequent urls in the past minute, hour, day
2. manager interview
code review
3. shortest path between two nodes of a tree(no parent pointer)