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


一亩三分地论坛

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

Bloomberg

[复制链接] |试试Instant~ |关注本帖
chuendes 发表于 2015-3-2 17:15:54 | 显示全部楼层 |阅读模式

2014(10-12月) 分析|数据科学类 博士 全职@Bloomberg - 网上海投 - 校园招聘会 |Other

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

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

x
1. what does a string look like in c? i.e. data structure.2. given a string, find the first duplicate character in this string
3. 100 light bubbles, could be switched to  on or off. The initial status is all off. The first round, switch every bubble, the second round, switch every two bubble, ......comes to the 100 round.
Question: how to implement this process. Follow up: at the end, what bubbles are on.
4. Fibonacci series. Find f(n). If using recursive, how to optimize it.
5. given an array, like [3,7,1,-2, 4,5]. Initially at the A[0], the walk for A steps, if positive, walk toward to right, if negative, walk toward to left. Determine whether it is a completer circle.
Definition of complete circle: a. able to return to A[0]. b.every point is visited.
How to implement this, and what's the time complexity.

评分

1

查看全部评分

本版积分规则

关闭

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

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

custom counter

GMT+8, 2017-9-20 14:00

Powered by Discuz! X3

© 2001-2013 Comsenz Inc. Design By HUXTeam

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