Amazon 2017-04
Last updated
Was this helpful?
Last updated
Was this helpful?
因为时间的关系,没有另外写开,只把link放这里了,最后还加了点面经题
亚麻的特点:bq是重点难点,principlal得全有例子。算法方面一定有hashmap,听说heap也考,纯linkedlist好像不多见。然后DP不考的感觉。图呀树呀DFS要各有一点。
Culture :
534 Design TinyURL
373 Find K Pairs with Smallest Sums
93 Restore IP Addresses
12 Integer to Roman
273 Number to English Word -- cc189
223 Rectangle Area
subarry sum ?
43 Multiply Strings
wiggle sort I, II
165 Compare Version Numbers
31 Next Permutation
(L374)
(L381)
e
(L582)
T
(L622)
- 也可以用union find来做&DFS (130)
(L615)
(L616)
(去重)(47)
(L192)
-- fibonacci
-- fibonacci
(53)
(L165)
(50)
--- 牛顿法
-- 2分
-- memorization
(261)
(L424)
(L468)
(L71) --
(81)