James Pan

原题网址：https://leetcode.com/problems/lru-cache/Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get

原题网址：http://www.lintcode.com/en/problem/consistent-hashing/一般的数据库进行horizontal shard的方法是指，把 id 对 数据库服务器总数 n 取模，然后来得到他在哪台机器上。这种方法的缺点是，当数据继续增加，我们需要增加数据库服务器，将 n 变为 n+1 时，几乎所有的数据都要移动，这就造成了不 consist

原题网址：https://leetcode.com/problems/design-hit-counter/Design a hit counter which counts the number of hits received in the past 5 minutes.Each function accepts a timestamp parameter (in seco

原题网址：https://leetcode.com/problems/logger-rate-limiter/Design a logger system that receive stream of messages along with its timestamps, each message should be printed if and only if it is not p

原题网址：https://leetcode.com/problems/design-twitter/Design a simplified version of Twitter where users can post tweets, follow/unfollow another user and is able to see the 10 most recent tweets in

原题网址：http://www.lintcode.com/en/problem/url-parser/Parse a html page, extract the Urls in it.Hint: use regex to parse html.Have you met this question in a real interview? Yes

原题网址：http://www.lintcode.com/en/problem/inverted-index/Create an inverted index with given documents. NoticeEnsure that data does not include punctuation.Have you met thi

原题网址：http://www.lintcode.com/en/problem/mini-cassandra/Cassandra is a NoSQL storage. The structure has two-level keys.Level 1: raw_key. The same as hash_key or shard_key.Level 2: column_

原题网址：http://www.lintcode.com/en/problem/consistent-hashing-ii/在 Consistent Hashing I 中我们介绍了一个比较简单的一致性哈希算法，这个简单的版本有两个缺陷：增加一台机器之后，数据全部从其中一台机器过来，这一台机器的读负载过大，对正常的服务会造成影响。当增加到3台机器的时候，每台服务器的负载量不

原题网址:http://www.lintcode.com/en/problem/memcache/Implement a memcache which support the following features:get(curtTime, key). Get the key's value, return 2147483647 if key does not exis