请问大家推荐的Harry Wang律师的联系信息？一个包子答谢。# Immigration - 落地生根
B*1
1 楼
之前似乎好几个人onsite google都遇到过的，但是今天在careercup上面居然看到说
interview要求o(n+m)，请问怎么做到啊？
Longest Common Prefix from N strings of max length "m".
I gave a naive approach of O(n.m) and O(m.logn) with some adjustments but
Interviewer wanted something O(n+m) or better than O(n.m).
Please suggest solutions.
eg:
Flower
Flow
Flight
Output:
Fl
interview要求o(n+m)，请问怎么做到啊？
Longest Common Prefix from N strings of max length "m".
I gave a naive approach of O(n.m) and O(m.logn) with some adjustments but
Interviewer wanted something O(n+m) or better than O(n.m).
Please suggest solutions.
eg:
Flower
Flow
Flight
Output:
Fl
