10月28,K神开课讲数据科学,你来吗?


一亩三分地论坛

 找回密码
 获取更多干活,快来注册
Babeltime游戏工作室招工程师、美术和策划
Tubi TV招安卓、前端和机器学习工程师
把贵司招聘信息放这里
查看: 790|回复: 2
收起左侧

VMTurbo 家新鲜面经(3.2016)

[复制链接] |试试Instant~ |关注本帖
aifer 发表于 2016-3-19 02:14:07 | 显示全部楼层 |阅读模式

2016(1-3月) 码农类 硕士 全职@VMTurbo - 网上海投 - 在线笔试 |Otherfresh grad应届毕业生

注册一亩三分地论坛,查看更多干货!

您需要 登录 才可以下载或查看,没有帐号?获取更多干活,快来注册

x
刚刚做完VMTurbo的 OA。题目依然是老的。1.分发圣诞装饰品, 红的超35%放到红桶里,绿的超过30%放到绿桶,如果是两者都满足,直接reject。

2. 迷宫里找cheese,注意找不到的话,路径返回是个null值,另外记得判断place是否合法的时候三个条件:1不是Null, 2不是wall, 3不是visited过的. more info on 1point3acres.com

评分

1

查看全部评分

xavwayne 发表于 2016-4-6 23:30:42 | 显示全部楼层
楼主和我的timeline好像, 我马上要电面了, 改天求教onsite的面经~
回复 支持 反对

使用道具 举报

blackrose 发表于 2016-4-7 00:39:21 | 显示全部楼层
Online test first and then phone interview. In the phone interview, I was asked a very easy question: binary search to find the rightmost index of the target value...... This is really f u c k ing simple enough. I solved it first using the worst time complexity linearly first. The interview seemed unsatisfied. She asked me to revised it into using reversion. I told her that my function doesn't support recursion.... she said, that is fine. you can just write it..... erh.... I revised my function and start coding recursion, But the time is not enough.... I thought maybe she is Chinese as well. Can let me pass. Worst time complexity O(n) is acceptable by leetcode, it should be fine..... rejection letter at the second day.... erh, Good luck with yours!
回复 支持 反对

使用道具 举报

本版积分规则

关闭

一亩三分地推荐上一条 /5 下一条

手机版|小黑屋|一亩三分地论坛声明

custom counter

GMT+8, 2017-9-21 06:09

Powered by Discuz! X3

© 2001-2013 Comsenz Inc. Design By HUXTeam

快速回复 返回顶部 返回列表