Re: 最好吃的还是方便面 (转载)# Joke - 肚皮舞运动
J*n
1 楼
先过了两轮OA，一轮一个题目(for data engineer)，一轮两个题目(software
engineer)
data engineer题目：
given a sorted array of positive integers, write a function that returns
true if the array contains a bomb and false otherwise
a bomb is defined as 3 (or more) consecutive paris of integers, e.g.
[1, 2, 2, 3, 3, 4, 5, 5] does not contain bomb
[1, 2, 2, 3, 3, 4, 4, 5] contains bomb(2, 2, 3, 3, 4, 4)
[1, 1, 2, 2, 4, 4] does not contain bomb(not consecutive)
[1, 2, 2, 3, 3, 3, 3, 4, 4, 5] still contains a bomb
software engineer题目：
1. give a array of 0 and 1s, you can flip one sub range of the array,
determine the maximal value of array after the flip. e.g given [0, 0, 0],
the best range to flip is 0~2 and maximal value would be 3
[0, 1, 0], you can flip the first one, or the last one, or all the three(but
can't just flip the first and last one as the range has to be continuous),
and the maximal value would be 2
2. uneaten leaves, 具体题目貌似是给一个数字N，表示叶子的数目（叶子编号从1到N
），和一个array of integer，表示虫子，每个虫子只吃自己数字倍数的叶子，问最后
剩下多少叶子。
过了OA recruiter反馈说很好，就安排了店面。店面要求用skype。但安排了第一次店
面三哥折腾了20来分钟都没加上对方的skype，后来发现貌似是发的invite被delay了，
skype真是够烂的，所以只能reshedule到第二天再面。
第二天的面试官是个华人小哥，感觉很不好，一上来啥也没说第一句话就是what's
your best accomplishment，然后又是what's one thing you would like to change
if you have the ability. 然后让做题，第一道很简单，给了array of 0 and 1s,
find how many continuous range of the same value, 秒code过，然后又扩展到2维
matrix，找出有多少个region of same values, 讲了一下思路，然后就开始写，期间
在什么时候停止搜索那翻了错误，经小哥提示改了过来。最后答案他表示ok。但中间小
哥一直不知道在他那边干吗，老是有刮东西敲东西的声音，略不爽。完了问了几个关于
他们team和公司的问题就结束了，昨天收到hr说won't proceed with the two
positions....之前和hr聊的时候还说如果software engineer这个不match可以再单独
面data engineer的。。。。
anyway, 回馈本班然后move on吧
engineer)
data engineer题目：
given a sorted array of positive integers, write a function that returns
true if the array contains a bomb and false otherwise
a bomb is defined as 3 (or more) consecutive paris of integers, e.g.
[1, 2, 2, 3, 3, 4, 5, 5] does not contain bomb
[1, 2, 2, 3, 3, 4, 4, 5] contains bomb(2, 2, 3, 3, 4, 4)
[1, 1, 2, 2, 4, 4] does not contain bomb(not consecutive)
[1, 2, 2, 3, 3, 3, 3, 4, 4, 5] still contains a bomb
software engineer题目：
1. give a array of 0 and 1s, you can flip one sub range of the array,
determine the maximal value of array after the flip. e.g given [0, 0, 0],
the best range to flip is 0~2 and maximal value would be 3
[0, 1, 0], you can flip the first one, or the last one, or all the three(but
can't just flip the first and last one as the range has to be continuous),
and the maximal value would be 2
2. uneaten leaves, 具体题目貌似是给一个数字N，表示叶子的数目（叶子编号从1到N
），和一个array of integer，表示虫子，每个虫子只吃自己数字倍数的叶子，问最后
剩下多少叶子。
过了OA recruiter反馈说很好，就安排了店面。店面要求用skype。但安排了第一次店
面三哥折腾了20来分钟都没加上对方的skype，后来发现貌似是发的invite被delay了，
skype真是够烂的，所以只能reshedule到第二天再面。
第二天的面试官是个华人小哥，感觉很不好，一上来啥也没说第一句话就是what's
your best accomplishment，然后又是what's one thing you would like to change
if you have the ability. 然后让做题，第一道很简单，给了array of 0 and 1s,
find how many continuous range of the same value, 秒code过，然后又扩展到2维
matrix，找出有多少个region of same values, 讲了一下思路，然后就开始写，期间
在什么时候停止搜索那翻了错误，经小哥提示改了过来。最后答案他表示ok。但中间小
哥一直不知道在他那边干吗，老是有刮东西敲东西的声音，略不爽。完了问了几个关于
他们team和公司的问题就结束了，昨天收到hr说won't proceed with the two
positions....之前和hr聊的时候还说如果software engineer这个不match可以再单独
面data engineer的。。。。
anyway, 回馈本班然后move on吧
