发20个包子吧# Living
g*x
1 楼
PHONE 1:
1. how to print a string backward
2. write code to find common elements in two arrays (2 pointers or hashtable)
3. ways to find pairs of elements that has specific sum
4. describe java gc, diff between strong and weak references
5. OOD for hotel reservation sys
6. two servers and one DB, how to improve performance
PHONE 2:
1. write code to find pairs of elements that has specific sum, e.g, 1, 1, 2,
3, 3, sum=4, return {{1, 3}, {1, 3}, {1, 3}, {1, 3}}
2. what if array very huge (millions of TB of elements)
ONSITE
1. replace all "1-800-xxx-xxxx" with "help line" in all .
html files under all subdirectories of a given dir
2. longest increasing consecutive subsequence. e.g. 3, 2, 4, 5, 1, 6. return
{2, 4, 5}
3. if amazon bookstore want to list top authors, how do you define "top"
4. get first pair of numbers in array that sum up to given value, return
their positions, e.g, 1, 1, 2, 4, 4, sum=5, return {0, 3}
5. check if a binary tree is BST
6. diff between HashMap and HashSet
7. implement HashMap
面试后第二天就收到拒信，可是拒信里写说“I will return your resume to the
candidate database where all Amazon.com recruiters and hiring managers may
review your qualifications for other opportunities within Amazon.com”，然后
又听一个在A公司工作的同学说有两种，一种就是直接拒了，还有一种是recycle，就是
放回去如果有人要就不用再从头一关关地面了，可能就跟hiring manager还有bar
raiser面一下。。。不知道有没有童鞋有过挂了以后又被请去第二次onsite的经历？
1. how to print a string backward
2. write code to find common elements in two arrays (2 pointers or hashtable)
3. ways to find pairs of elements that has specific sum
4. describe java gc, diff between strong and weak references
5. OOD for hotel reservation sys
6. two servers and one DB, how to improve performance
PHONE 2:
1. write code to find pairs of elements that has specific sum, e.g, 1, 1, 2,
3, 3, sum=4, return {{1, 3}, {1, 3}, {1, 3}, {1, 3}}
2. what if array very huge (millions of TB of elements)
ONSITE
1. replace all "1-800-xxx-xxxx" with "help line" in all .
html files under all subdirectories of a given dir
2. longest increasing consecutive subsequence. e.g. 3, 2, 4, 5, 1, 6. return
{2, 4, 5}
3. if amazon bookstore want to list top authors, how do you define "top"
4. get first pair of numbers in array that sum up to given value, return
their positions, e.g, 1, 1, 2, 4, 4, sum=5, return {0, 3}
5. check if a binary tree is BST
6. diff between HashMap and HashSet
7. implement HashMap
面试后第二天就收到拒信，可是拒信里写说“I will return your resume to the
candidate database where all Amazon.com recruiters and hiring managers may
review your qualifications for other opportunities within Amazon.com”，然后
又听一个在A公司工作的同学说有两种，一种就是直接拒了，还有一种是recycle，就是
放回去如果有人要就不用再从头一关关地面了，可能就跟hiring manager还有bar
raiser面一下。。。不知道有没有童鞋有过挂了以后又被请去第二次onsite的经历？
