c*******g 发帖数: 93 | 1 Onsite之后直接口头通知。面经稍后奉上。
面经如下:
本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。
Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括:
1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way.
This is easy. Just establish a cache co |
P*****s 发帖数: 484 | 2 cong! baozi
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
p*****o 发帖数: 543 | 3 con!!
still the same salary as those posted here? |
l******u 发帖数: 207 | 4 是你麽?
我也排队包子
哈哈
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
H*M 发帖数: 1268 | 5 cong!
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
m*****f 发帖数: 1243 | |
w****i 发帖数: 34 | |
c******e 发帖数: 27 | 8 cong!
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
m******9 发帖数: 968 | |
l*********e 发帖数: 63 | 10 cong~~
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
|
|
m******8 发帖数: 102 | 11 CONG~
【在 l*********e 的大作中提到】 : cong~~
|
m******8 发帖数: 102 | 12 有个问题想问楼主,给你发信了,多谢了先
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
g*******y 发帖数: 1930 | |
a*****p 发帖数: 189 | |
n******r 发帖数: 1247 | 15 Gxgx
收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大
家可以参考我前面的发贴。
R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术
性问题包括:
, i.e. every number is repeated several times. You want to compute the
output (e.g. factorial) based on each input. Design an algorithm to do this
in a fast way.
distinct numbers. Each time a new input comes in just look it up in the
cache. If found you can use the value already computed if not you can go
through the tedious computing proc
a tunnel with length 100. The distance fro
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
f****b 发帖数: 486 | 16 cong!
收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大
家可以参考我前面的发贴。
R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术
性问题包括:
, i.e. every number is repeated several times. You want to compute the
output (e.g. factorial) based on each input. Design an algorithm to do this
in a fast way.
distinct numbers. Each time a new input comes in just look it up in the
cache. If found you can use the value already computed if not you can go
through the tedious computing proc
a tunnel with length 100. The distance fr
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
D******n 发帖数: 2836 | 17 what position?
收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大
家可以参考我前面的发贴。
R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术
性问题包括:
, i.e. every number is repeated several times. You want to compute the
output (e.g. factorial) based on each input. Design an algorithm to do this
in a fast way.
distinct numbers. Each time a new input comes in just look it up in the
cache. If found you can use the value already computed if not you can go
through the tedious computing proc
a tunnel with length 100. The di
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
s*********g 发帖数: 849 | 18 CONG~! 谢谢分享面经和包子。
收到
online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可
以参考我前
面的发贴。
R&D包括
一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题
包括:
numbers, i.e. every number is repeated several times. You want to
compute the output (e.g. factorial) based on each input. Design an
algorithm to do this in a fast way.
distinct numbers. Each time a new input comes in just look it up in the
cache. If found you can use the value already computed if not you can go
through the tedious computing procedure.
inside a tunn
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
c*******u 发帖数: 1657 | |
c*****r 发帖数: 67 | 20 cong!
收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大
家可以参考我前面的发贴。
R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术
性问题包括:
, i.e. every number is repeated several times. You want to compute the
output (e.g. factorial) based on each input. Design an algorithm to do this
in a fast way.
distinct numbers. Each time a new input comes in just look it up in the
cache. If found you can use the value already computed if not you can go
through the tedious computing proc
a tunnel with length 100. The distance fr
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
|
|
c*******g 发帖数: 93 | 21 financial software developer
The same salary as described by previous people
this
【在 D******n 的大作中提到】 : what position? : : 收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大 : 家可以参考我前面的发贴。 : R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术 : 性问题包括: : , i.e. every number is repeated several times. You want to compute the : output (e.g. factorial) based on each input. Design an algorithm to do this : in a fast way. : distinct numbers. Each time a new input comes in just look it up in the
|
s*****A 发帖数: 426 | |
a****n 发帖数: 230 | |
c*****o 发帖数: 178 | |
b********n 发帖数: 632 | 25 cong
收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大
家可以参考我前面的发贴。
R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术
性问题包括:
, i.e. every number is repeated several times. You want to compute the
output (e.g. factorial) based on each input. Design an algorithm to do this
in a fast way.
distinct numbers. Each time a new input comes in just look it up in the
cache. If found you can use the value already computed if not you can go
through the tedious computing proc
a tunnel with length 100. The distance fro
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
a****l 发帖数: 245 | |
l*******y 发帖数: 1498 | |
M******g 发帖数: 1179 | 28 cong and zhan!zhan!!
bless us all!
收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大
家可以参考我前面的发贴。
R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术
性问题包括:
, i.e. every number is repeated several times. You want to compute the
output (e.g. factorial) based on each input. Design an algorithm to do this
in a fast way.
distinct numbers. Each time a new input comes in just look it up in the
cache. If found you can use the value already computed if not you can go
through the tedious computing proc
a tunnel wit
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
s*****0 发帖数: 113 | 29 我也来恭喜一下吧,我的bloomberg直接fail在online test上了,move on... |
c******f 发帖数: 2144 | |
|
|
c*******g 发帖数: 93 | 31 Update: 包子已经发给前23楼的朋友,请查收!抱歉23楼以后的朋友,我已散尽家财,
再无包子可给,但还是衷心感谢你们祝福!
这一阵子在忙OPT的事情,希望顺利拿到EAD卡吧。。。 |
b****o 发帖数: 378 | |
y*******n 发帖数: 195 | 33 The answer from Bloomberg for the last question is wrong: local maximums
have nothing to do with the global maximum.
Think about the world cup football match, Group A contains 4 teams from
south America and Group B contains 4 teams from Asia and only one team from
each group goes to the next round. Brazil manages to get out from group A
and Japan from group B while Argentina from group A fails. Now do you think
Japan is better than Argentina? I think not.
收到online test通知,做完test当天就来了第一轮电面的通知。关于店
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
d*****t 发帖数: 242 | 34 i think there is another run needed after the 5 winnners' run
suppose the rank for the 5 winners are A, B, C, D, E, i.e., no.1 from groupA
is the final winner
then you let the no.2 and no.3 of group A, no.1 and no.2 of group B, and no.
1 of group C to run together. it will gives u the 2nd and 3rd
in your example, you need no.2 from groupA to play with japan
from
think
【在 y*******n 的大作中提到】 : The answer from Bloomberg for the last question is wrong: local maximums : have nothing to do with the global maximum. : Think about the world cup football match, Group A contains 4 teams from : south America and Group B contains 4 teams from Asia and only one team from : each group goes to the next round. Brazil manages to get out from group A : and Japan from group B while Argentina from group A fails. Now do you think : Japan is better than Argentina? I think not. : : 收到online test通知,做完test当天就来了第一轮电面的通知。关于店
|
v*****n 发帖数: 480 | 35 太赞勒
gxgx~
收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大
家可以参考我前面的发贴。
R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术
性问题包括:
, i.e. every number is repeated several times. You want to compute the
output (e.g. factorial) based on each input. Design an algorithm to do this
in a fast way.
distinct numbers. Each time a new input comes in just look it up in the
cache. If found you can use the value already computed if not you can go
through the tedious computing procedure.
a tunnel with length 100. The d
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
u***e 发帖数: 19 | |
p******a 发帖数: 299 | |
P**********0 发帖数: 412 | |
a**x 发帖数: 188 | |
a******e 发帖数: 523 | 40 zan!!! Cong!!!! baozi baozi |
|
|
TN 发帖数: 1870 | 41 cong
收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大
家可以参考我前面的发贴。
R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术
性问题包括:
, i.e. every number is repeated several times. You want to compute the
output (e.g. factorial) based on each input. Design an algorithm to do this
in a fast way.
distinct numbers. Each time a new input comes in just look it up in the
cache. If found you can use the value already computed if not you can go
through the tedious computing proc
a tunnel with length 100. The distance fro
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
m**x 发帖数: 790 | |
J****n 发帖数: 392 | 43 试着答一下第三题:
首先是分五组,每组5马,计五次。需要记住每组的前三名。
然后五个第一名做一组赛一次,第一肯定是最快的,第二,第三也可能入选,记做A1,
A2, A3。
然后第二名的五马赛一次,前两名可能入选,记做B1, B2
再就是第三名的五马赛一次,第一名可能入选,记做C1。
最后A2, A3, B1, B2, C1赛一次,前两名分别是第二和第三快的。这样的话共计赛
9次。
有两种特殊情况,就是如果B1如果和A3最开始是一组的,赛前7次就可以了,A1,A2,
A3入选。如果B1和A2或者B2和A3最开始是一组的,五个第三名的那次就不用赛了。比8
次就可以了,当然最后那一次就没有C1参加了。
不知对不对,请指正。
收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大
家可以参考我前面的发贴。
R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术
性问题包括:
, i.e. every number is repeated several times. You want to compute the
outpu
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
c**********e 发帖数: 2007 | 44 christing,
Congratulations!
Could you please detail how to establish a cache. I have never used
cache. Thanks.
, i.e. every number is repeated several times. You want to compute the
output (e.g. factorial) based on each input. Design an algorithm to do this
in a fast way.
distinct numbers. Each time a new input comes in just look it up in the
cache. If found you can use the value already computed if not you can go
through the tedious computing procedure.
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|
m*****k 发帖数: 731 | 45 for Q2, where is the train? |
M******g 发帖数: 1179 | 46 cong and zhan
bless us allW
收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大
家可以参考我前面的发贴。
R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术
性问题包括:
, i.e. every number is repeated several times. You want to compute the
output (e.g. factorial) based on each input. Design an algorithm to do this
in a fast way.
distinct numbers. Each time a new input comes in just look it up in the
cache. If found you can use the value already computed if not you can go
through the tedious computing proc
a tunnel with lengt
【在 c*******g 的大作中提到】 : Onsite之后直接口头通知。面经稍后奉上。 : 面经如下: : 本人背景是物理的PhD+统计的MS,三流学校。去年12月底投简历,大约一个星期之后收到online test通知,做完test当天就来了第一轮电面的通知。关于店面的问题,大家可以参考我前面的发贴。 : Onsite当天从11点开始,一共见了5个人,包括两个R&D,一个Senior和两个HR。两个R&D包括一个美国人和一个印度人,都很友善。问了一些关于做过的project。其他技术性问题包括: : 1. You have a series of input which contains only say, 10 distinct numbers, i.e. every number is repeated several times. You want to compute the output (e.g. factorial) based on each input. Design an algorithm to do this in a fast way. : This is easy. Just establish a cache co
|