电面1
Text Justification
电面2
Given a number of tasks (T) and servers (S), find out if the tasks
can be accommodated on the servers. Each Task has a number of
Units and each server has a number of Slots on which Units can run.
The only condition is that two Units of the same Task “cannot”
run on the same Server.
task 可以切分,而且同一个task的不同部分, 不能在同一个server上.
On site
第一轮
Add Binary
设计电梯
Heap 如何实现的
Java 里如何实现 多线程
第二轮
Add Two Numbers II
Count Numbers with Unique Digits
股票1
Dijkstra’s shortest path algorithm
第三轮
徒手实现hashmap
如何实现ConcurrentHashMap
第四轮
Find subarray with given sum negative Numbers
Zigzag Iterator of string
Odd Even Linked List
第五轮
Design 一个 Rate Limiter 系统
// return true only if there are < 100 requests from a given IP in the last 1 minute