由买买提看人间百态

boards

本页内容为未名空间相应帖子的节选和存档,一周内的贴子最多显示50字,超过一周显示500字 访问原贴
JobHunting版 - 面经
相关主题
某家onsite面经哪个高手能指出我程序的问题 (20几行的代码)
LD明天面DreamCompany,求bless,onsite回来一定发面经回报大家List Flattening from book
文本编辑器设计, 要求append, insert, delete均为O(1)how would you create the index for a book
也发个linkedin的店面面经question about big data
Linkedin onsite 面经G电面一题
leetcode上zigzag converstion那题怎么才能通过large?Get first Greater in a array
请教Google 一道算法题又面了一上午,M家的,大家进来做题
转一些我blog上以前总结题目的日记(四)二叉树最长路径 用 level order travel 做?
相关话题的讨论汇总
话题: linkedlist话题: c++话题: oo话题: recursion话题: amazon
进入JobHunting版参与讨论
1 (共1页)
z*j
发帖数: 42
1
Amazon:
First round:
1. C++ and OO questions
2. Write a linkedlist support append at tail
3. Given a linkedlist, find duplicate elements
4. Given a linkedlist, group by different elements
Second round:
1. C++ and OO questions
2. Reservoir sampling
3. A brain teaser
4. design pattern
Onsite:
OO and C++ questions
Recursion and non-recursion version code. like reverse linkedlist, post-
order traverse a tree, permutation. (I found Amazon likes recursion a
lot. Almost each interviewer asked me about
b******v
发帖数: 1493
2
多谢!

【在 z*j 的大作中提到】
: Amazon:
: First round:
: 1. C++ and OO questions
: 2. Write a linkedlist support append at tail
: 3. Given a linkedlist, find duplicate elements
: 4. Given a linkedlist, group by different elements
: Second round:
: 1. C++ and OO questions
: 2. Reservoir sampling
: 3. A brain teaser

c****i
发帖数: 2287
3
thanks for sharing!
m******p
发帖数: 5393
4
thx
bless

【在 z*j 的大作中提到】
: Amazon:
: First round:
: 1. C++ and OO questions
: 2. Write a linkedlist support append at tail
: 3. Given a linkedlist, find duplicate elements
: 4. Given a linkedlist, group by different elements
: Second round:
: 1. C++ and OO questions
: 2. Reservoir sampling
: 3. A brain teaser

m*****g
发帖数: 226
5
Postfix order of an arithmetic expression.
能不能讲讲这个是什么题目?
z*j
发帖数: 42
6
3*2+3 -> 32*3+, during the interview, I was only asked to support +-*/.
M******k
发帖数: 51
7
能不能更详细一些说一下:CPU bound and I/O bound situation, how to
multithread.

【在 z*j 的大作中提到】
: Amazon:
: First round:
: 1. C++ and OO questions
: 2. Write a linkedlist support append at tail
: 3. Given a linkedlist, find duplicate elements
: 4. Given a linkedlist, group by different elements
: Second round:
: 1. C++ and OO questions
: 2. Reservoir sampling
: 3. A brain teaser

z*j
发帖数: 42
8
tow types of tasks: cpu bound and i/o bound
on multi-cpu(32 cpu) machine and single-cpu machine, how to handle tasks.
I wasn't very sure about my answers. I don't have experience on multi-cpu
optimization. So I only mentioned some very basic ideas, like DMA, thread
pool.
1 (共1页)
进入JobHunting版参与讨论
相关主题
二叉树最长路径 用 level order travel 做?Linkedin onsite 面经
T onsite一题leetcode上zigzag converstion那题怎么才能通过large?
找零钱dp的问题请教Google 一道算法题
一道面试题求解转一些我blog上以前总结题目的日记(四)
某家onsite面经哪个高手能指出我程序的问题 (20几行的代码)
LD明天面DreamCompany,求bless,onsite回来一定发面经回报大家List Flattening from book
文本编辑器设计, 要求append, insert, delete均为O(1)how would you create the index for a book
也发个linkedin的店面面经question about big data
相关话题的讨论汇总
话题: linkedlist话题: c++话题: oo话题: recursion话题: amazon