http://www.mitbbs.com/article_t/JobHunting/32986743.html

两周前onsite，5轮，上周HR打电话HC过了，match了team，现在在等最后VP 和 SVP的
review， 求Bless !

有些题版上出现过

Product of word length which words that share no letters(all lower case)
E.g {feed , see, stuck }: max product: 5x4=20
Complexity?
Follow up:
Optimal way to exit earlier in loop.


2. RLE run-length compression
http://en.m.wikipedia.org/wiki/Run-length_encoding

Encode: helll=> he3xl,   decode
Requirements:1. Decode(encode(s))==s; 2. Shortest length
Follow up: unit test: test requirement 1&2

3. Word abbreviation,
e.g. Between=>b5n,  friend=>f4d 
Follow-up: implement 
Bool checkduplicate(string [] dict, string word) 
E.g. {feed }, feed => false;  {door }, deer =>true;  {dare}, deer => false
如果dict里有word 和input word的abbreviation 一样，则return true

4. Poland operation list convert to tree 
E.g. {push 4, push 5, add, push 9, mul, sqrt} => tree: {sqrt,  {mul,{9, add(
4,5)}}}


5. Design Question: Get program running on data centers, try catch and 
scalability , cache followups