凉凉的高盛onsite~

"subarray要考虑negative。" can not use two pointers... Do you have solutions better than O(n^2)? Thanks!

补充内容 (2018-6-27 08:27):
Onsite third round, first question, do you have solution better than O(n^2) for negative numbers. Second round is to separate pos and neg, and do combinatorial search? Thanks!

fledgling 发表于 2018-6-27 08:24
"subarray要考虑negative。" can not use two pointers... Do you have solutions better than O(n^2)? Tha ...

leetcode 862

投行职称序列和科技公司不一样，不要被VP吓到了，估计相当于Google的6或者high end 5

Andrewchentao48 发表于 2018-7-27 11:57
楼主几年工作经验啊

刚刚两年哈～

freeaccount 发表于 2018-7-27 23:30
投行职称序列和科技公司不一样，不要被VP吓到了，估计相当于Google的6或者high end 5

嗯，我后来也发现了！不过我觉得我只是一个2年的Junior，所以这个level应该怎么都是不太合适哈哈哈。

明天面高盛codepad