j*e
3 楼
太强的人感觉留不住,干脆就不招
b*g
4 楼
哎,竟然如此,只好从了offer了。
B*5
5 楼
有过同样经历。。。
b*g
7 楼
所有题目都最后搞到最优解,最后一道题目,直接电脑上编, 一次bug free, 最优复
杂度, 吃中饭的时候和人下了两盘棋,还赢了面试我的人。。。本以为肯定有offer呢
。。哎。。
杂度, 吃中饭的时候和人下了两盘棋,还赢了面试我的人。。。本以为肯定有offer呢
。。哎。。
b*g
13 楼
那天太神勇了。。主要都是常见题。。
1. two sum, sorted and unsorted version
2. reverse K group linked list
3. binary search tree(lowest common ancestor), extend to binary tree case
4. find unnecessary classes to compile a class in a package .
5. reverse a sentence word by word "I am joe" ---> I ma eoj
6. permutation of a string, I wrote the recursive way first and next_
permutation implementation after that.
7. intersection of two sorted array
8. rotate of a matrix, NxN case, I use transpose, NxM case, I use replace
loop to in place rotate.
9. design a collection framework, what's the interface, list, set, map
10. difference between generics in java and template in C++
11. email sending, a batch of emails send to servers, any batch can hold any
number of emails with different receiving address, minimize the number of
batches.
12. find anagram of a list of words
13. design a board game
14. soduku validation .
还有一些记不住了,呵呵。。
【在 L********d 的大作中提到】![](/moin_static193/solenoid/img/up.png)
: 太烂了,淘汰
: 太出众了,淘汰
1. two sum, sorted and unsorted version
2. reverse K group linked list
3. binary search tree(lowest common ancestor), extend to binary tree case
4. find unnecessary classes to compile a class in a package .
5. reverse a sentence word by word "I am joe" ---> I ma eoj
6. permutation of a string, I wrote the recursive way first and next_
permutation implementation after that.
7. intersection of two sorted array
8. rotate of a matrix, NxN case, I use transpose, NxM case, I use replace
loop to in place rotate.
9. design a collection framework, what's the interface, list, set, map
10. difference between generics in java and template in C++
11. email sending, a batch of emails send to servers, any batch can hold any
number of emails with different receiving address, minimize the number of
batches.
12. find anagram of a list of words
13. design a board game
14. soduku validation .
还有一些记不住了,呵呵。。
【在 L********d 的大作中提到】
![](/moin_static193/solenoid/img/up.png)
: 太烂了,淘汰
: 太出众了,淘汰
g*e
14 楼
我了个去 这些一天写下来还不废了
s*r
16 楼
楼主的确神勇,这样水平到那里都是大牛,别在乎这一家,是他们的损失。
另外只是想提醒一下,楼主有没有反思,除了技术能力外,哪里出了纰漏?
以这样的技术能力,走遍天下不用愁的,move on!
另外只是想提醒一下,楼主有没有反思,除了技术能力外,哪里出了纰漏?
以这样的技术能力,走遍天下不用愁的,move on!
g*e
17 楼
看来是个小公司 你太牛了 他们支持不住
s*n
19 楼
hehe, 小公司就别暴名字了吧
s*o
20 楼
写这么多,人都残了吧
而且居然题目还都记住了。。。
【在 b********g 的大作中提到】![](/moin_static193/solenoid/img/up.png)
: 那天太神勇了。。主要都是常见题。。
: 1. two sum, sorted and unsorted version
: 2. reverse K group linked list
: 3. binary search tree(lowest common ancestor), extend to binary tree case
: 4. find unnecessary classes to compile a class in a package .
: 5. reverse a sentence word by word "I am joe" ---> I ma eoj
: 6. permutation of a string, I wrote the recursive way first and next_
: permutation implementation after that.
: 7. intersection of two sorted array
: 8. rotate of a matrix, NxN case, I use transpose, NxM case, I use replace
而且居然题目还都记住了。。。
【在 b********g 的大作中提到】
![](/moin_static193/solenoid/img/up.png)
: 那天太神勇了。。主要都是常见题。。
: 1. two sum, sorted and unsorted version
: 2. reverse K group linked list
: 3. binary search tree(lowest common ancestor), extend to binary tree case
: 4. find unnecessary classes to compile a class in a package .
: 5. reverse a sentence word by word "I am joe" ---> I ma eoj
: 6. permutation of a string, I wrote the recursive way first and next_
: permutation implementation after that.
: 7. intersection of two sorted array
: 8. rotate of a matrix, NxN case, I use transpose, NxM case, I use replace
P*m
21 楼
唯一能想到的:
都作对了,而且太快,被认定是背题的?
都作对了,而且太快,被认定是背题的?
b*n
31 楼
同悲催,也有过题目都答对没得到offer的经历
h*e
32 楼
楼主太强了,拿不到offer也是正常的,看过杜拉拉升职记吗?
w*x
35 楼
哪家公司问这么多题? 楼主不是来消遣我们的吧
p*a
36 楼
惊人!
【在 b********g 的大作中提到】![](/moin_static193/solenoid/img/up.png)
: 那天太神勇了。。主要都是常见题。。
: 1. two sum, sorted and unsorted version
: 2. reverse K group linked list
: 3. binary search tree(lowest common ancestor), extend to binary tree case
: 4. find unnecessary classes to compile a class in a package .
: 5. reverse a sentence word by word "I am joe" ---> I ma eoj
: 6. permutation of a string, I wrote the recursive way first and next_
: permutation implementation after that.
: 7. intersection of two sorted array
: 8. rotate of a matrix, NxN case, I use transpose, NxM case, I use replace
【在 b********g 的大作中提到】
![](/moin_static193/solenoid/img/up.png)
: 那天太神勇了。。主要都是常见题。。
: 1. two sum, sorted and unsorted version
: 2. reverse K group linked list
: 3. binary search tree(lowest common ancestor), extend to binary tree case
: 4. find unnecessary classes to compile a class in a package .
: 5. reverse a sentence word by word "I am joe" ---> I ma eoj
: 6. permutation of a string, I wrote the recursive way first and next_
: permutation implementation after that.
: 7. intersection of two sorted array
: 8. rotate of a matrix, NxN case, I use transpose, NxM case, I use replace
V*5
37 楼
木秀于林,孙必摧之~
s*l
44 楼
答得太好了 他们担心 日后 你能力太强抢了他们的位子。。。
lz,
第一题 two sum什么意思啊?
第四题 能具体说一下什么意思吗?
还有 能说说 第11题吗?
谢谢
【在 b********g 的大作中提到】![](/moin_static193/solenoid/img/up.png)
: 那天太神勇了。。主要都是常见题。。
: 1. two sum, sorted and unsorted version
: 2. reverse K group linked list
: 3. binary search tree(lowest common ancestor), extend to binary tree case
: 4. find unnecessary classes to compile a class in a package .
: 5. reverse a sentence word by word "I am joe" ---> I ma eoj
: 6. permutation of a string, I wrote the recursive way first and next_
: permutation implementation after that.
: 7. intersection of two sorted array
: 8. rotate of a matrix, NxN case, I use transpose, NxM case, I use replace
lz,
第一题 two sum什么意思啊?
第四题 能具体说一下什么意思吗?
还有 能说说 第11题吗?
谢谢
【在 b********g 的大作中提到】
![](/moin_static193/solenoid/img/up.png)
: 那天太神勇了。。主要都是常见题。。
: 1. two sum, sorted and unsorted version
: 2. reverse K group linked list
: 3. binary search tree(lowest common ancestor), extend to binary tree case
: 4. find unnecessary classes to compile a class in a package .
: 5. reverse a sentence word by word "I am joe" ---> I ma eoj
: 6. permutation of a string, I wrote the recursive way first and next_
: permutation implementation after that.
: 7. intersection of two sorted array
: 8. rotate of a matrix, NxN case, I use transpose, NxM case, I use replace
n*k
46 楼
我自己切身的经历,我自己的分析,我自己的总结:
1.做对了,但是说不清
2.题目见过,不跟面试官说实话,愣充当场先想,露馅儿
3.做对了,但是经过提醒才对
4.你觉得做对了,其实不是
5.做对了,但时间花的太长,面试官本来要你再做一个的
6.面试官觉得你精神面貌和气质不适合在他们公司
7.人家已经找好人了,就跟你走一过场儿
1.做对了,但是说不清
2.题目见过,不跟面试官说实话,愣充当场先想,露馅儿
3.做对了,但是经过提醒才对
4.你觉得做对了,其实不是
5.做对了,但时间花的太长,面试官本来要你再做一个的
6.面试官觉得你精神面貌和气质不适合在他们公司
7.人家已经找好人了,就跟你走一过场儿
相关阅读
冲刺VP再次失败菜鸟问题:cover letter里hiring manager不知道是谁怎么办?麻痹的敢抢老子的功老,给你种木马外包烙印的标准简历:索尼之死 (转载)用绿卡找工作和用H1b找工作 效果能差多少呢?h1b貌似没中,求纽约附近cpt挂靠学校我来开个帖子, 说说在国内try to be a 码农的经历吧。。Re: 总结几个求职网站 (转载)未来最看好的新主修和行业:DMS [注意:这可是我的原创] (转载)新人来求个GS内推钱多活少离家近,位高权重责任轻小公司店面,面经分享这个版也是挺有意思的请教一下 Amazon bar raiser 看重最后的代码吗Change office location within the same company, redo GC? (转载)flag里面rutgers毕业的多不多。FLAG里哪些有末位淘汰?可以一个月的时间里在二个公司同时上班吗?h1b没抽中的各位怎么和hr谈,这都什么时候了律师居然说pp的抽中可能性还大有AppDynamics这公司怎么样?