原来多看可以读EPUB# PDA - 掌中宝
x*k
1 楼
amazon 第一轮phone interveiw面经，印女
1. the most challenging project.
2. linklist, hash table, bst,
In what case prefer bst over hash table.
3, write a function to search in a rotated array.
4. OOdesign for a deck of poke.
1. the most challenging project.
2. linklist, hash table, bst,
In what case prefer bst over hash table.
3, write a function to search in a rotated array.
4. OOdesign for a deck of poke.
