一亩三分地论坛

 找回密码
 获取更多干货,去instant注册!

扫码关注一亩三分地公众号
查看: 1885|回复: 1
收起左侧

Amazon OA1 + OA2 3/2 due

[复制链接] |试试Instant~ |关注本帖
zhushigang 发表于 2016-3-3 07:34:50 | 显示全部楼层 |阅读模式

2016(1-3月) 码农类 硕士 全职@Amazon - 内推 - 在线笔试 |Otherfresh grad应届毕业生

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

您需要 登录 才可以下载或查看,没有帐号?获取更多干货,去instant注册!

x
Timeline: 2/4内推, 2/10收到RC5邮件填表,2/17收到OA1(2/24 due),2/24提交,2/25收到OA2(3/2 due),3/2提交
.鏈枃鍘熷垱鑷1point3acres璁哄潧
OA1:
debug: 地里面经都有,无难度
reasoning: 老题,快递费+6人桌
coding: sliding window minimum (leetcode #239 最大变最小). 1point 3acres 璁哄潧

OA2:
work simulation: 略. Waral 鍗氬鏈夋洿澶氭枃绔,
coding: BST min path,Round Robin
. more info on 1point3acres.com
附上根据地里面经总结的coding题:
OA1:
1. Overlap rectangle

2. K closest points

3. window sum

4. longest palindromic substring
https://leetcode.com/problems/longest-palindromic-substring/

5. merge two linked list
https://leetcode.com/problems/merge-two-sorted-lists/

6. two sum count / do not count duplicates. 涓浜-涓夊垎-鍦帮紝鐙鍙戝竷

7. Check subtree

8. Valid Parentheses

9. reverse second half of linkedlist

10. graycode check

11. rotate String

12. remove vowel. from: 1point3acres.com/bbs

13. Search Matrix II

14. Sliding window minimum. 鐗涗汉浜戦泦,涓浜╀笁鍒嗗湴
https://leetcode.com/problems/sliding-window-maximum/

15. optimal Capacity

16. The maximum of minimums of pathes in matrix

. 鐣欏鐢宠璁哄潧-涓浜╀笁鍒嗗湴
OA2: . 1point 3acres 璁哄潧
1. Round Robin Scheduling:
Given an array of arriving time ,an array of processing time and the quantum number q. Calculate the average waiting time of the system using Round Robin scheduling. . Waral 鍗氬鏈夋洿澶氭枃绔,

2. Rotate Matrix. Given a n by n matrix and a flag, return the matrix rotated right if flag == 1 else return the matrix rotated left. . 1point3acres.com/bbs

3. Return the minimum sum of a path in a BST from node to leaf.

4. Insert value into a circular sorted linkedlist. (Given node may not be the smallest)

5. Greatest Common Divisor, given an array of integers, return the gcd of them.

6. Shortest job first scheduling:
Given an array of arriving time and an array of processing time. Calculate the average waiting time of the system using shortest job first scheduling.

7. Count Cache Miss (LRU)
Given an array of integers and the size of a cache, return the cache miss count. (If cache hit, move this int to the tail, if size exceeds size, remove head)

8. Day change: given an array and number of days. Rules: if arr[i-1] == arr[i+1], arr = 0 else arr = 1, do that for n days.
Similar: leetcode Game of life https://leetcode.com/problems/game-of-life/

9. Find path in maze
Given a m*n matrix representing a Maze, 0 is a path and 1 is a wall. a mouse is at [0,0] and a cheese (represented as 9) is at [i, j]. Return true if there is a path from the mouse to the cheese else return false.

(OA1) 10. Check subtree. Check weather t2 is a subtree of t1

(OA1) 11. Valid parenthesis

(OA1) 12. reverse second half of linked list

13. Same Tree, check if 2 tree are the same

14. find out number of arithmetic sequence in array, if result > 1 billion return -1.

15. Amplitude, find the difference between the maximum and minimum value in a binary tree.

(OA1) 16. K closest point

(OA1) 17. Find loop in Linked list / find the head of the loop

18. Given four integers, public int solution(int A, int B, int C, int D){}
变换他们的位置,使得,F(S) = abs(S[0]-S[1]) + abs(S[1]-S[2]) + abs(S[2]-S[3]) 最大。其中,S[0],S[1],S[2],S[3]就是ABCD要对应的位置。. 鐗涗汉浜戦泦,涓浜╀笁鍒嗗湴

(OA1) 19. window sum

. 鐗涗汉浜戦泦,涓浜╀笁鍒嗗湴

补充内容 (2016-3-4 01:06):
3/3 收到onsite。。。

评分

6

查看全部评分

hurtlocker 发表于 2016-3-3 15:38:40 | 显示全部楼层
coding总结得很详细也全面,谢谢啦!

请问work simulation能再具体讲讲么?有复习资料可分享下?

貌似只能给你一个大米... 喏都给你了
回复 支持 反对

使用道具 举报

本版积分规则

请点这里访问我们的新网站:一亩三分地Instant.

Instant搜索更强大,不扣积分,内容组织的更好更整洁!目前仍在beta版本,努力完善中!反馈请点这里

关闭

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

手机版|小黑屋|一亩三分地论坛声明 ( 沪ICP备11015994号 )

custom counter

GMT+8, 2016-12-11 06:51

Powered by Discuz! X3

© 2001-2013 Comsenz Inc. Design By HUXTeam

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