架构师面试题.docxVIP

架构师面试题　　1. 设计文件系统　　2. 数据结构for spreadsheet　　3. 一个app需要用cache，怎么实现thread safe　　4. social network, billions id, every id has about 100 friends roughly, what is　　max connections between any two ppls. write algorithm to return min　　connections between two ids: int min_connection(id1, id2)　　you can call following functions　　expand(id) return friends list of id　　expandall(list) return friends union of all the ids in the ersection(list1, list2) return intersection　　removeintersection(list1, list2)　　5. Open , you type some words in the edit box to search something, it will return lots of search results