【新人发帖】G家电面

原帖地址:一亩三分地

阿三的口音自带难度……还好在GoogleDoc上写的挺详细
问了两道题:
1. 理论题: Flaky test: It’s a test which when run many times fails a few times.
Reasons?2. coding: give a list of string, define product as:product(s1, s2) = 0 if s1 and s2 have charactor overlap s1.length * s2.length if s1 and s2 are distinct
find the max product of the list.
刚开始直接想到 string permutation,就说了sort和hashmap求frequency的两种办法,但阿三似乎都不满意,一直问能不能减少operation
实在想不出,厚颜无耻的问 can you give me a hint, recruiter很不错的提示说bitmap,眼前一亮呀!最后就是用bit operation 处理的

求onsite呀~~~
第一次发帖,还请大家赏米呀~(求能搜索)