发个forusall 2轮电面

第一轮：there's a row of seat, people come and go. write an algorithm to assign people to an available seat such that the distance from nearest people is maximam possible. 就是用heap, 但要处

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

cating, splitting the picture. 最后才搞清他想说什么。。。。
没说结果，但肯定是fail了，那无奈不耐的笑，中间很多次的never mind...

yoyowingboy 发表于 2018-10-11 05:27
请问第一轮的面试管是谁

a chinese female. can't remember name.
I can't remember the coding problem in 2nd round. it's array problem that needs 2 pointers technique. Messy boundary checks. Can't get it right just one shot.  Anyway I don't think they're really gonna to hire.....
As for the system design, it's open question, I don't understand as well......

感谢分享，祝楼主早日拿到offer!!

请问下，第二轮 第一题具体是什么？ 还有第二题是什么意思呢？ 存储坐标？

请问第一轮的面试管是谁

楼主，第一个座位问题是利口849吗？已经加米了，感谢楼主分享

tjuwdz95 发表于 2018-10-25 02:53
**** 本内容被作者隐藏 ****

好像是的

tjuwdz95 发表于 2018-10-21 00:49
楼主，第一个座位问题是利口849吗？已经加米了，感谢楼主分享

我觉得比leetcode要难得多
it takes into account many scenarios, like one seated person leaving, 2 end points, etc.  
the problem is framed as this, given a row of N seats, and an array indicating a person coming in and leaving
you have to return the best seat for the people coming in.
Hope it helps

koga 发表于 2018-10-24 15:55
我觉得比leetcode要难得多
it takes into account many scenarios, like one seated person leaving, 2  ...

您好！
本帖隐藏的内容需要积分高于 233 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 233 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies