Dec 15 NY Google Onsite

原帖地址:一亩三分地

回报地里,圣诞节前的一个星期在NY面的

Round one:
1. Game of Life (Leetcode)
Follow up: how to scale if the board has 1 million rows and columns
用MapReduce

Round two:
.1point3acres缃/span>1. Gate and Wall (Leetcode)
2 Range Sum Query 2D – Mutable(Leetcode)
用 Binary Indexed Tree

Round Three
. 1point3acres.com/bbs
1. How to Model HTML dococument
用Tree

2. Check if two documents represend by tree have the same inner text
首先extract all text in the tree and then compare
考官不满意,然后写个Iterator,用Iterators进行比较

Round Four

1. Given a binary tree, find all duplicate subtrees
后序访问树,计算每个节点的Hash并且保存在一个HashMap里,
如果有相同的Hash,需要进行比较确认后
然后讨论怎么样计算Hash和一些优化

Round Five (System Design)
– How to design Google Search Suggestion

HC passed and sent ot executive committee
求bless